- DISCOVERING PROBLEM SOLUTIONS WITH LOW KOLMOGOROV COMPLEXITY AND
- C J. Schmidhuber, 1994. LOWCOMPLEXITY ART
- SEMILINEAR PREDICTABILITY MINIMIZATION PRODUCES ORIENTATION SENSITIVE EDGE
- Predicate Abstraction and Refinement for Verifying Multi-Threaded Programs
- Dual Analysis for Proving Safety and Finding Bugs Corneliu Popeea
- Towards a Quantitative Estimation of Abstract Interpretations (Extended abstract)
- Analysing Memory Resource Bounds for Low-Level Programs Wei-Ngan Chin1 Huu Hai Nguyen1 Corneliu Popeea1 Shengchao Qin2
- A Practical and Precise Inference and Specializer for Array Bound Checks Elimination
- Inferring Disjunctive Postconditions Corneliu Popeea and Wei-Ngan Chin
- Deriving Safety Pre-Condition for Array Bounds Check in Imperative Programs
- "Politehnica" University of Bucharest Faculty of Automatic Control and Computers
- An AutomataTheoretic Approach to Linear Temporal Logic
- Making the World Differentiable: On Using SelfSupervised Fully Recurrent Neural Networks for Dynamic Reinforcement Learning
- CONVERGENCE THRESHOLDS OF NEWTON'S METHOD FOR MONOTONE POLYNOMIAL EQUATIONS
- Non-Monotonic Refinement of Control Abstraction for Concurrent Programs
- A Type System for Resource Protocol Verification and its Correctness Proof
- ADAPTIVE CONFIDENCE AND ADAPTIVE CURIOSITY Jurgen Schmidhuber
- jMoped: A Test Environment for Java Programs (Tool Paper)
- Bisimulation, Model Checking and Other Games \Lambda
- Symposium on Theoretical Aspects of Computer Science year (city), pp. numbers www.stacs-conf.org
- LIPIcs Leibniz International Proceedings in Informatics On the Memory Consumption of
- An Extension of Newton's Method to -Continuous Semirings
- Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems
- Parikh's Theorem: A simple and direct automaton construction
- Non-Java Applications Support Octavian Purdila
- NEURAL SEQUENCE CHUNKERS Jurgen Schmidhuber
- Space-efficient scheduling of stochastically generated tasks
- Synchronization Component Verication Vlad Gheorghe
- Verifying Safety Policies with Size Properties and Alias Controls Wei-Ngan Chin1,2
- LEARNING TO CONTROL FASTWEIGHT MEMORIES: AN ALTERNATIVE TO
- Probabilistic Abstractions with Arbitrary Andreas Gaiser and Javier Esparza
- Newton's Method for -Continuous Semirings Javier Esparza, Stefan Kiefer, Michael Luttenberger
- Solving Monotone Polynomial Equations Javier Esparza, Stefan Kiefer, and Michael Luttenberger
- CONVERGENCE THRESHOLDS OF NEWTON'S METHOD FOR MONOTONE POLYNOMIAL EQUATIONS
- Design and Implementation of an Improved Floating Point Adder Unit on FPGA
- AN O(n 3 ) LEARNING ALGORITHM FOR FULLY RECURRENT NETWORKS
- Characterization of Simulation Performance for Ethernet using
- ON LEARNING HOW TO LEARN LEARNING STRATEGIES
- LONG SHORT TERM MEMORY Technical Report FKI20795
- Refinement of Chart Patterns in Raluca Musaloiu-Elefteri
- From Tests To Proofs Ashutosh Gupta1
- A Flow-Based Approach for Variant Parametric Types Wei-Ngan Chin Florin Craciun Siau-Cheng Khoo Corneliu Popeea
- Threader: A Constraint-based Verifier for Multi-Threaded Programs
- Disjunctive Invariants for Modular Static Analysis Corneliu Popeea
- Solving Recursion-Free Horn Clauses over LI+UIF
- Neural Modeling of the Kinematics of Robot Trajectories M. Eldracher, D. Hern'andez, M. Kinder \Lambda
- Electronic Notes in Theoretical Computer Science 6 (1997) URL: http://www.elsevier.nl/locate/entcs/volume6.html ?? pages
- Abstraktion: Applikation
- Qualitative representation of positional information
- Fundamenta Informaticae XX (2004) 1--23 1 A PolynomialTime Algorithm for Checking Consistency of
- Grundresolutionsalgorithmus adikatenlogische
- propositions Satisfiability
- , , 1--33 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- C J. Schmidhuber, 1994. LOWCOMPLEXITY ART
- Technische Universit at M unchen SS 1997 Institut f ur Informatik L osungsvorschl age zu Blatt 4
- Towards a Multiagent System for Competitive Website Ratings
- ADAPTIVE CONFIDENCE AND ADAPTIVE CURIOSITY Jurgen Schmidhuber
- Rewriting Models of Boolean Programs Ahmed Bouajjani 1# and Javier Esparza 2##
- Fundamenta Informaticae 30 (1997) 23--41 1 Petri Nets, Commutative ContextFree Grammars,
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik L osungsvorschl age zu Blatt 8
- Eine Experimentierumgebung f ur verteiltes Lernen und Scheduling \Lambda
- On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
- Anwendung des Theorembeweisers SETHEO auf angeordnete K orper
- Supervised Subgoal Generation for Manipulators M. Eldracher \Lambda , B. Baginski
- Daten u analyse Daten u analyse besch aftigt sich damit, den \Flu " von Daten durch ein Programm zu verfolgen.
- Technische Universit at M unchen SS 1996 Institut f ur Informatik
- An Improvement of McMillan's Unfolding Algorithm Javier Esparza and Stefan Romer \Lambda (fesparza---roemerg@in.tum.de)
- Exploring auction-based leveled-commitment contracting
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik
- UNIVERSIT INSTITUT F
- FORSCHUNGSBERICHTE K''UNSTLICHE INTELLIGENZ
- Technische Universit at M unchen SS 1996 Institut f ur Informatik
- Technische Universit at M unchen SS 1996 Institut f ur Informatik
- On Building Flexible Agents Gerhard Wei
- Wahrscheinlichkeitsr Wahrscheinlichkeitsraum
- Exploring auctionbased leveledcommitment contracting
- Hilbert`sche Kalk Formelschema
- 1LevelBuckets gespeicherten
- A Logical Viewpoint on Process-Algebraic Quotients Anton n Ku cera
- Software Tools for Technology Transfer manuscript No. (will be inserted by the editor)
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik
- Technische Universit at M unchen SS 1996 Institut f ur Informatik L osungsvorschl age zu Blatt Klausur
- (L;F;Lab;F;E; ; zustzliche
- Reachability Analysis of Synchronized PA Systems Ahmed Bouajjani 1 , Javier Esparza 2 , and Tayssir Touili 3
- Beispiel: Java Bytecode Veri er Eines der Merkmale der Programmiersprache Java ist der Einsatz von Bytecode, einer Art von
- Relative Representation of Spatial Knowledge: The 2D Case
- Monotonic SetExtended Prefix Rewriting and Verification of Recursive PingPong Protocols
- Interpretation abstraktenWerten Beispiel
- On Spatial Reference Frames in Qualitative Motion Representation
- An Efficient Algorithm to Compute Maximum Entropy Densities
- Universit at Polymorphie
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik L osungsvorschl age zu Blatt 7
- Secure and Private Auctions without Auctioneers Felix Brandt
- Constraint-based Analysis of Broadcast Giorgio Delzanno 1 , Javier Esparza 2 , and Andreas Podelski 1
- Technische Universit at M unchen SS 1996 Institut f ur Informatik L osungsvorschl age zu Blatt 1
- Technische Universit at M unchen Institut f ur Informatik
- Approximative Methods for Monotone Systems of minmaxPolynomial Equations #
- Model Checking LTL using Constraint Programming ?
- On Fixed Point Equations over Commutative Javier Esparza, Stefan Kiefer, and Michael Luttenberger
- On Fixed Point Equations over Commutative Javier Esparza, Stefan Kiefer, and Michael Luttenberger
- Konnektionsmethode adikatenlogik)
- Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL
- Characteristics interaction
- An effective tableau system for the linear time calculus
- AN O(n 3 ) LEARNING ALGORITHM FOR FULLY RECURRENT NETWORKS
- Derivation Tree Analysis for Accelerated FixedPoint Computation
- Preface page ix 1 Motivating Examples 1
- Computer Simulation of Language Acquisition: A Proposal concerning early
- E#ziente Algorithmen und Datenstrukturen II Markus Holzer
- HCI Aspects of a Framework for the Qualitative Representation of Space \Lambda y
- Technische Universit at M unchen SS 1997 Institut f ur Informatik L osungsvorschl age zu Blatt 11
- Grundresolutionsalgorithmus adikatenlogische
- On the Convergence of Newton's Method for Monotone Systems of Polynomial Equations #
- Technische Universit at M unchen SS 1997 Institut f ur Informatik
- An Extension of Newton's Method to #Continuous Semirings #
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik L osungsvorschl age zu Blatt 3
- Abschlu bericht ACON 1 Zuwendungsempf anger
- Technische Universit at M unchen Institut f ur Informatik
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik
- Modal and Temporal Properties of Processes (Preliminary Draft)
- An Unfolding Algorithm for Synchronous Products of Transition Systems #
- Diskrete Strukturen II Erg anzungen zum Skript
- SEMILINEAR PREDICTABILITY MINIMIZATION PRODUCES ORIENTATION SENSITIVE EDGE
- INFINITY 2004 Preliminary Version Reachability Analysis of Synchronized PA
- Extracting Semantic Features for Aspectual Meanings from a Syntactic
- IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. 23, NO. 5, MAY 1997 1 J:\PRODUCTION\TSE\2INPROD\MAY\104928.0\104928_1.DOC regularpaper97.dot S 27,136 05/29/97 4:13 PM 1 / 17
- While-Programme Um Beweise
- Technische Universit at M unchen Institut f ur Informatik
- Theoretical Issues Concerning the Representation of ContinuousValued Input and Output Data in Neural Networks \Lambda
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik L osungsvorschl age zu Blatt 2
- Proposition Deterministic
- Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances
- Quick Trajectory Generation for Manipulators Using Incremental Randomized Graph Construction
- adikatenlogik ausgezeichnetes
- Fundamenta Informaticae 46 (2001) 1--17 na --(PU) 1 Unfolding Based Algorithms for the Reachability Problem #
- Default reasoning and the qualitative representation of spatial knowledge \Lambda y
- Technische Universit at M unchen Institut f ur Informatik
- Newton's Method for #Continuous Semirings # Javier Esparza, Stefan Kiefer, Michael Luttenberger
- Detecting Malicious Code by Model Checking Johannes Kinder, Stefan Katzenbeisser, Christian Schallhart, Helmut Veith
- Der 4RussenAlgorithmus algorithm fourrussians(array a;b;c) =
- Technische Universit at M unchen SS 1997 Institut f ur Informatik L osungsvorschl age zu Blatt 8
- Exploring auction-based leveled-commitment contracting
- An Automatatheoretic Approach to Interprocedural Dataflow Analysis
- Bisimulation, Model Checking and Other Games \Lambda
- Neuronale Lernverfahren zur Modellierung der Semantik spatialer Ausdr ucke Stand der
- Technische Universit at M unchen SS 1997 Institut f ur Informatik L osungsvorschl age zu Blatt 5
- Technische Universit at M unchen Institut f ur Informatik
- Linearit at Erwartungswerts
- jMoped: A Java Bytecode Checker Based on Dejvuth Suwimonteerabuth, Stefan Schwoon, and Javier Esparza
- Technische Universit at M unchen SS 1996 Institut f ur Informatik
- DISCOVERING PROBLEM SOLUTIONS WITH LOW KOLMOGOROV COMPLEXITY AND
- Ersetzbarkeitstheorem Satz (Ersetzbarkeitstheorem)
- Eq(M,N):bool derzeitiges
- Technische Universit at M unchen Institut f ur Informatik
- Wahrscheinlichkeit Wahrscheinlichkeit
- A Uniform Framework for Problems on Context-Free Grammars
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik
- The Java^TM LanguageEnvironment AWhitePaper
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik L osungsvorschl age zu Blatt 5
- Net Reductions for LTL ModelChecking # Javier Esparza and Claus Schroter
- constraints constraint,
- Literaturverzeichnis [AG97a] M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus.
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik
- Technische Universitat Fakultat fur Informatik
- A Logical Viewpoint on ProcessAlgebraic Quotients Antonn Ku cera ?1 and Javier Esparza ??2
- jMoped: A Java bytecode checker based on Dejvuth Suwimonteerabuth, Stefan Schwoon, and Javier Esparza
- Improved Gaussian Mixture Density Estimates Using Bayesian Penalty Terms and Network
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik
- On the Verification of Broadcast Protocols Javier Esparza \Lambda Alain Finkel y Richard Mayr z
- Synchronization without oscillatory neurons HansMartin R. Arnoldi 1 and Wilfried Brauer 2
- More Infinite Results Javier Esparza \Lambda
- The C & C Companion Transitional Semantics
- Classification of Trajectories Extracting Invariants with a Neural Network
- Technische Universit at M unchen Institut f ur Informatik
- Technische Universit at M unchen Institut f ur Informatik
- I/O-Automaton input-enabled
- Zentral ubung zur Einf uhrung in die Informatik II
- Technische Universit at M unchen SS 1996 Institut f ur Informatik L osungsvorschl age zu Blatt 9
- Skript zur Vorlesung Berechenbarkeit
- Mark P. Jones August 9, 1996
- Technische Universit at M unchen Institut f ur Informatik
- Technische Universit at M unchen SS 1997 Institut f ur Informatik
- Helsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 60
- Making the World Differentiable: On Using SelfSupervised Fully Recurrent Neural Networks for Dynamic Reinforcement Learning
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik L osungsvorschl age zu Blatt 4
- Abschlubericht Zuwendungsempf anger
- Satz: Sei T ein Entscheidungsbaum f ur die Bestimmung des ikleinsten von n verschiedenen Elements, mit
- Technische Universit at M unchen Institut f ur Informatik
- Technische Universit at M unchen Institut f ur Informatik
- International Journal of Foundations of Computer Science World Scienti c Publishing Company
- A Graphical User Interface ---Proposal ---
- Kontinuierliche Warscheinlichkeitsr
- Listenmanipulation Universit at
- Interaction frames for arti cial agents Michael Rovatsos
- Technische Universit at M unchen SS 1996 Institut f ur Informatik L osungsvorschl age zu Blatt 3
- Zwischensprache Hochsprache
- Function Approximation With ContinuousValued Activation Functions in CMAC
- Technische Universit at M unchen SS 1996 Institut f ur Informatik
- Classification of NonLinearSeparable RealWorldProblems Using 1Rule, Perceptrons, and Topologically Distributed Encoding
- An Ecient Automata Approach to Some Problems on Context-Free Grammars
- Vergleich: LTL, CTL, HML LTL: linear time
- J. Inform. Process. Cybernet. EIK 30 (1994) 3, 143--160 (formerly: Elektron. Inform.verarb. Kybernet.)
- Technische Universit at M unchen Institut f ur Informatik
- Technische Universit at M unchen Institut f ur Informatik
- REASONING WITH QUALITATIVE REPRESENTATIONS: EXPLOITING THE STRUCTURE OF SPACE \Lambda y
- Universit at Wertzuweisung
- Verifying Probabilistic Procedural Programs Javier Esparza 1 and Kousha Etessami 2
- Grenzwertsatz Grenzwertsatz)
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik
- Derivation Tree Analysis for Accelerated FixedPoint Computation
- Feature Selection with Exception Handling Using Adaptive Distance Measures
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik L osungsvorschl age zu Blatt 12
- Technische Universit at M unchen SS 1996 Institut f ur Informatik L osungsvorschl age zu Blatt 8
- real time LTL 1 Real Time LTL
- Name: Vorname: Matr.Nr: Technische Universit at M unchen SS 1996
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik L osungsvorschl age zu Blatt 11
- Verification using PEP ? Stephan Melzer, Stefan Romer ?? and Javier Esparza
- Algorithmen Flu probleme
- Decidability of Model Checking for InfiniteState Concurrent Systems \Lambda
- Microscopic description The H&E sections show a tumor with a predominately papillary
- Technical Report FKI22297 Sepp Hochreiter
- AConst_Null Transferfunktionen
- Simple Onthefly Automatic Verification of Linear Temporal Logic
- Model Checking Probabilistic Pushdown Automata Javier Esparza
- Substitutionen [Variable=Term].
- Communicating (Bergstra,Klop,Baeten/Weijland,Fokking)
- MI --Eine Maschine f ur die Informatikausbildung Uwe Borghoff
- descriptions Equivalence
- Private Public Choice Felix Brandt
- Technische Universit at M unchen SS 1996 Institut f ur Informatik L osungsvorschl age zu Blatt 4
- Complementation construction
- Technische Universit at M unchen Institut f ur Informatik
- Name: Vorname: Matr.Nr: Technische Universit at M unchen SS 1996
- A Neural Trajectory Storage \Lambda Margit Kinder, Till Brychcy
- Substitutionen [Variable=Term].
- Die Modellierung des Stenning-Protokolls mit I/O-Automaten
- Warscheinlichkeitsr Wahrscheinlichkeitsraum
- Interpretation h[n:=3*n+1]
- Path Planning for SixJoint Manipulators by Generalization from Example Paths
- Maintaining Qualitative Spatial Knowledge \Lambda y
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik L osungsvorschl age zu Blatt 13
- RotSchwarzB RotSchwarzB
- On the Mechanized Veri cation of In nite Systems Christine Rockl and Javier Esparza
- Technische Universit at M unchen SS 1996 Institut f ur Informatik L osungsvorschl age zu Blatt 7
- Analysis and Prediction of the LongRun Behavior of Probabilistic Sequential Programs with Recursion
- Skript zur Vorlesung Prof. Javier Esparza
- The PEP Verification System 1 Eike Best 2 , Javier Esparza 3 , Bernd Grahlmann 4 ,
- Technische Universit at M unchen Institut f ur Informatik
- Einfhrung in die Informatik IV Skript zur Vorlesung
- Ordnungen und Fixpunkte Eines der wichtigsten mathematische Werkzeuge zur Programmanalyse sind partielle Ordnungen
- Feature Selection by Means of a Feature Weighting Approach M. Scherf 1 , W. Brauer 2
- Simple representative instantiations for multicast protocols
- Unentscheidbarkeit von Terminierung Nur Programme mit numerischer Eingabe
- Monotonic SetExtended Prefix Rewriting and Verification of Recursive PingPong Protocols
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik
- To appear in Proc. COSIT'95, LNCS, Springer. 1 Qualitative distances
- ON LEARNING HOW TO LEARN LEARNING STRATEGIES
- The Asynchronous Committee Meeting Problem Javier Esparza 1 and Bernhard von Stengel 2
- Netzwerkfluproblem 1 Grundlagen stNetzwerke,
- FLAT MINIMUM SEARCH FINDS SIMPLE NETS
- Kinematic Path Planning for Manipulators in Dynamic Environments Using Adaptive Neural Models and Neural
- Technische Universit at M unchen Institut f ur Informatik
- Why the Partigame Algorithm Does not Work Satisfyingly for Manipulator Trajectory Generation
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik
- Ecient Algorithms for pre and post on Interprocedural Parallel Flow Graphs Javier Esparza
- Technische Universit at M unchen Institut f ur Informatik
- St o L ---literate programming in Scheme Daniel Kobler
- Representation of spatial knowledge Daniel Hern'andez
- 1.3.3 Qualittsmanagement und Qualittssicherung Produktorientiert: Komponenten
- Technical Report FKI24200 Optimising Route Weighting in Telecommunication
- Languages, Automata, and Logic Wolfgang Thomas \Lambda
- computation propositions
- Technische Universit at M unchen SS 1996 Institut f ur Informatik L osungsvorschl age zu Blatt 2
- Technische Universit at M unchen SS 1996 Institut f ur Informatik L osungsvorschl age zu Blatt 1
- MarkovKetten MarkovKette
- Alternating-Bit-Protokoll ftime,timeoutg
- CONVERGENCE THRESHOLDS OF NEWTON'S METHOD FOR MONOTONE POLYNOMIAL EQUATIONS
- Diagrammatical Aspects of Qualitative Representations of Space \Lambda
- Technische Universit at M unchen SS 1996 Institut f ur Informatik
- Petri Nets and Regular Processes Petr Jancar
- Nichtsequentielle Sommersemester
- Name: Vorname: Matrikelnummer: Technische Universit at M unchen
- Antisocial Bidding in Repeated Vickrey Auctions Felix Brandt
- LONG SHORT TERM MEMORY Technical Report FKI20795
- Technische Universit at M unchen SS 1996 Institut f ur Informatik L osungsvorschl age zu Blatt 6
- Multiobjective Modelbased Evolution Strategy Dany Meyer, Kratzer AG Mnchen
- Kleinigkeiten Universit at
- A Concurrency Workout Joachim Parrow
- Qualitative Representation of the Course of Motion: Cognitive and Psychophysical Foundations
- Eine Simulationsumgebung f ur adaptive und verteilte Lastverteilung \Lambda
- LEARNING TO CONTROL FASTWEIGHT MEMORIES: AN ALTERNATIVE TO
- Technische Universit at M unchen Institut f ur Informatik
- Hier also eine Minimalanleitung zur Ein und Ausgabe in einem Applet: Notwendige Einbez uge
- Eine Fuzzy-Basis fur qualitative Bewegungsreprasentation
- Mail-System insert.remove.BUFFER
- Programmierumgebung Universit at
- An AutomataTheoretic Approach to Linear Temporal Logic
- An Improvement of McMillan's Unfolding Algorithm
- Kurzeste Pfade Betrachte Digraph G= (V;A) oder Graph G= (V;E).
- Technische Universit at M unchen SS 1996 Institut f ur Informatik
- Determining stabilization
- An Automata Approach to Some Problems on ContextFree Grammars
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik L osungsvorschl age zu Blatt 10
- Reachability in Live and Safe FreeChoice Petri Nets is NPcomplete
- Complementation construction
- GaloisVerbindung Funktionen :L!M;
- Technische Universit at M unchen SS 1996 Institut f ur Informatik L osungsvorschl age zu Blatt 5
- Formal Methods: State of the Art and Future Edmund M. Clarke and Jeannette M. Wing
- On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
- Technische Universit at M unchen WS 1995/96 Institut f ur Informatik L osungsvorschl age zu Blatt 9
- Pattern Classification with Adaptive Distance Measures
- Convergence Thresholds of Newton's Method for Monotone Polynomial Equations #
- Achieving Coordination through Combining Joint Planning and Joint Learning
- Universitat Stuttgart Institut fur Formale Methoden der Informatik
- Some Studies in Distributed Machine Learning
- Introduction Copyright 1994, 1995 Sun Microsystems The Java^TM Language: An Overview 1 of 8
- Reachability Analysis Using Net Unfoldings ? Claus Schroter and Javier Esparza
- Syntax der Pr adikatenlogik Variablen, Symbole, Terme
- A Multiagent Framework for Planning, Reacting, and Learning
- Solving Monotone Polynomial Equations Javier Esparza, Stefan Kiefer, and Michael Luttenberger
- Inference in Markov Blanket Networks Reimar Hofmann
- Multilingual Generation of Grammatical Gabriele Scheler
- Informatikausbildung Inhaltsverzeichnis 1
- 36 Problems for Semantic Interpretation Gabriele Scheler
- NEURAL SEQUENCE CHUNKERS Jurgen Schmidhuber
- A PolynomialTime Algorithm for Checking Consistency of FreeChoice Signal Transition Graphs
- Ein Hilbert'scher Kalk ur die Pr adikatenlogik
- Modifizierte Modifizierte
- Approximative Methods for Monotone Systems of minmaxPolynomial Equations #
- Technische Universit at M unchen Institut f ur Informatik
- Reachability Analysis of Pushdown Automata: Application to ModelChecking
- Qualitative Motion Representation in Egocentric and Allocentric Frames of Reference
- ModelChecking LTL with Regular Valuations for Pushdown Systems #
- Approximative Methods for Monotone Systems of minmaxPolynomial Equations #
- Literatur zur Vorlesung Zeitautomaten, Sommersemester 04 [ACD93] R. Alur, C. Courcoubetis, and D. Dill. Model-checking in dense real-
- Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems #
- (Has appeared in: Proceedings of IJCAI-99, Morgan Kaufman Publishers, 1999, pages 1067-1073) Qualitative and Quantitative Representations of Locomotion
- Mengendarstellung Klausel: Menge von Literalen (Disjunktion).
- A Control-Flow-Analysis for Multi-Threaded Java with
- Grammars as Processes Javier Esparza
- Technische Universit at M unchen Institut f ur Informatik
- Name: Vorname: Matr.Nr: Technische Universit at M unchen SS 1997
- Ein weiteres, h au g eingesetztes Mittel zur Analyse von Programmen sind Typsysteme, die ei-nem Programm oder den in einem Programm vorkommenden Variablen einen Typ oder eine Sorte
- An Inductive Proof of the Wellfoundedness of the Multiset Order
- Communicating CCS-process
- Vorlesungsskript zu Parallele Komplexit#tstheorie
- propositions distinguished
- Eine intermedi are Schicht in der Bewegungswahrnehmung
- Definition Seien K 1 , K 2 und R Klauseln. Dann heit R Resolvent von K 1 und K 2 , falls es ein Literal L gibt mit L 2 K 1 und L 2 K 2
- w\Delta\Theta\Lambda\Xi\Pi\Sigma\Upsilon\Phi\Omega fffi flffiij `' ae/!'' #$%&' ()+,. /012 345!yA---Faculty of Informatics
- The Edinburgh Concurrency Workbench (Version 7)
- UNIVERSIT INSTITUT F
- FORSCHUNGSBERICHTE UNSTLICHE INTELLIGENZ
- CONVERGENCE THRESHOLDS OF NEWTON'S METHOD FOR MONOTONE POLYNOMIAL EQUATIONS
- On the model checking problem for branching time logics and Basic Parallel Processes
- Aquivalenzen Es gelten die folgenden
- Dekker's algorithm for two processes b 2 : boolean init false
- An Extension of Newton's Method to #Continuous Semirings #
- With raised eyebrows or the eyebrows raised ? A Neural Network Approach to
- Universit at Zeichenstr
- Helsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 68
- A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
- Hilbert'sche Kalk Formelschema
- Universitat Stuttgart Institut fur Formale Methoden der Informatik
- gespeichert gespeichert
- MarkovKetten kontinuierlicher
- A polynomial algorithm to compute the concurrency relation of freechoice Signal
- Model Checking LTL with Regular Valuations for Pushdown Systems 1
- Technische Universit at M unchen SS 1996 Institut f ur Informatik
- Proposition Deterministic
- On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
- jMoped: A Test Environment for Java Programs (Tool Paper)
- jMoped: A Test Environment for Java Programs Dejvuth Suwimonteerabuth, Felix Berger, Stefan Schwoon, and Javier Esparza
- Bachelor/Master Thesis: An Extension of a Tool for Modal Transition Systems
- Technische Universitat Munchen Fakultat fur Informatik
- Bachelor Thesis -An Advanced Solver for Presburger Arithmetic
- A Statistical Relational Model for Trust Learning Achim Rettinger
- Space-efficient scheduling of stochastically generated tasks
- Problems and Exercises "Nichtsequentielle Systeme und nebenlaufige
- From Tests To Proofs Ashutosh Gupta1
- Parikh's Theorem: A simple and direct automaton construction
- Diskrete Strukturen I Ernst W. Mayr
- Newton's Method for -Continuous Semirings Javier Esparza, Stefan Kiefer, Michael Luttenberger
- An Extension of Newton's Method to -Continuous Semirings
- Technische Universitat Fakultat fur Informatik
- Space-efficient scheduling of stochastically generated tasks Tomas Brazdil Javier Esparza
- Technische Universitat Munchen Wintersemester 2004/05 Institut fur Informatik Diskrete Strukturen I
- Derivation Tree Analysis for Accelerated Fixed-Point Computation
- Space-efficient scheduling of stochastically generated tasks$
- Verification Javier Esparza
- Implementierung des Tests auf Kreisfreiheit: Reprsentation der Zusammenhangskomponenten
- I N S T I T U T F U R I N F O R M A T I K COLA The Component Language
- InvGen: An Efficient Invariant Generator Ashutosh Gupta and Andrey Rybalchenko
- Probabilistic cellular automata The task is to explore the computational power of probabilistic cellular au-
- Java Bytecode Zwischensprache zwischen Hochsprache (Java) und
- A Semantics for Procedure Local Heaps and its Abstractions
- INSTITUTFURINFORMATIK DER TECHNISCHEN UNIVERSITAT MUNCHEN
- Newtonian Program Analysis Javier Esparza, Stefan Kiefer, and Michael Luttenberger
- Symposium on Theoretical Aspects of Computer Science year (city), pp. numbers www.stacs-conf.org
- Symbolic Context-Bounded Analysis of Multithreaded Java Programs
- Analysis of Communication Topologies by Partner
- Diskrete Strukturen I Ernst W. Mayr
- Comparison of Algorithms for Checking Emptiness on Buchi Automata
- LIPIcs Leibniz International Proceedings in Informatics On the Memory Consumption of
- JACM5706-33 Journal of the ACM October 1, 2010 22:5 Newtonian Program Analysis
- Bachelor/Master Thesis: A Tool for Modal Transition Systems
- Boosting Expert Ensembles for Rapid Concept Recall Achim Rettinger
- CORPORATETECHNOLOGY Information &
- 1RoadmapCourseOverview Introduction
- Diskrete Strukturen I Ernst W. Mayr
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2010 Society for Industrial and Applied Mathematics
- An Appreciation of the Work of Reinhard Wilhelm Thomas Reps1
- Locality-Based Abstractions Javier Esparza1
- Tool-support for the analysis of hybrid systems and models Andreas Bauer Markus Pister Michael Tautschnig
- arXiv:1004.4286v2[cs.PF]27Apr2010 Space-efficient scheduling of
- Solving Recursion-Free Horn Clauses over LI+UIF
- 1. Cellular Automata 1. Cellular Automata
- Bachelor or Master thesis: Strategy Iteration on the Graphics Card
- Language Equivalence for Probabilistic Automata
- jMoped: A Java bytecode checker based on Dejvuth Suwimonteerabuth, Stefan Schwoon, and Javier Esparza
- Non-Monotonic Refinement of Control Abstraction for Concurrent Programs
- CONVERGENCE THRESHOLDS OF NEWTON'S METHOD FOR MONOTONE POLYNOMIAL EQUATIONS
- A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
- Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
- Verification of Graph Transformation Systems with Context-Free Specifications
- HSF(C): A Software Verifier based on Horn Clauses
- 40Roadmap Course Overview Introduction
- 4.1 Definition und Beispiele 4.2 Eigenschaften von Korpern Diskrete Strukturen I
- TECHNISCHE UNIVERSITAT MUNCHEN Lehrstuhl fur Informatik VII
- Derivation Tree Analysis for Accelerated Fixed-Point Computation
- On Stabilization in Herman's Algorithm Stefan Kiefer1
- Optimizing Automatic Deployment Using Non-Functional Requirement Annotations
- Learning Initial Trust among Interacting Agents Achim Rettinger1
- A Benchmarking Suite for Measurement-Based WCET Analysis Tools Sven Bunte
- Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games
- Abstrakte Interpretation (I) Grundidee: Ausfhrung eines Programms auf
- COMPUTING THE LEAST FIXED POINT OF POSITIVE POLYNOMIAL SYSTEMS
- Derivation Tree Analysis for Accelerated Fixed-Point Computation
- 2.5 Gruppen Diskrete Strukturen I
- 154Roadmap Course Overview Introduction
- Grammars as Processes Javier Esparza
- Diskrete Strukturen I Ernst W. Mayr
- PD Dr. Martin Stetter, Siemens AG 1 Lernen von Datenmodellen: Approximation
- Interactive Proof: Introduction to Isabelle/HOL
- Net Reductions for LTL Model-Checking Javier Esparza and Claus Schroter
- Relational Analysis of Correlation Jorg Bauer1
- Technische Universit"at M"unchen WS 1995/96 Institut f"ur Informatik L"osungsvorschlag zu
- Technische Universit"at M"unchen SS 1996 Institut f"ur Informatik Info-Blatt zur
- Technische Universit"at M"unchen WS 1996/97 Institut f"ur Informatik U"bungsblatt 9
- Technische Universit"at M"unchen SS 1996 Institut f"ur Informatik L"osungsvorschlag zu
- Technische Universit"at M"unchen SS 1996 Institut f"ur Informatik L"osungsvorschlag zu
- Technische Universit"at M"unchen SS 1996 Institut f"ur Informatik L"osungsvorschlag zu
- Technische Universit"at M"unchen WS 1995/96 Institut f"ur Informatik "Ubungsblatt 2
- Technische Universit"at M"unchen WS 1996/97 Institut f"ur Informatik "Ubungsblatt 6
- Technische Universit"at M"unchen SS 1996 Institut f"ur Informatik "Ubungsblatt 5
- Technische Universit"at M"unchen SS 1996 Institut f"ur Informatik "Ubungsblatt 3
- Syntax of Standard ML Tobias Nipkow and Larry Paulson
- Research Reports 60 Teknillisen korkeakoulun tietojenkasittelyteorian laboratorion tutkimusraportti 60
- Allgemeine Ersetzungssysteme und Automaten 2.1 Kontextfreie Grammatiken und Kellerautomaten
- Automatic Generation of SystemC Models from Component-based Designs for Early Design Validation and
- 4.3 Polynome Diskrete Strukturen I
- A Logical Viewpoint on Process-Algebraic Quotients Antonn Kucera
- On Spatial Reference Frames in Qualitative Motion Representation
- A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
- Model Classes Michael Sturm, Till Brychcy, Clemens Kirchmair
- CORPORATETECHNOLOGY Information &
- MoTraS -A Tool for Modal Transition Systems Martin Stoll
- Diskrete Strukturen I Ernst W. Mayr
- Reachability Analysis of Synchronized PA Systems Ahmed Bouajjani1, Javier Esparza2, and Tayssir Touili3
- An Unfolding Algorithm for Synchronous Products of Transition Systems
- Approximative Methods for Monotone Systems of min-max-Polynomial Equations
- Model-Checking LTL with Regular Valuations for Pushdown Systems
- An Extension of Newton's Method to -Continuous Semirings
- Komplexitatstheorie 2003 Problemset 3
- }w!"#$%&123456789@ACDEFGHIPQRS`ye| FI MU Faculty of Informatics
- On Probabilistic Parallel Programs with Process Creation and Synchronisation
- Reliable Operating Modes for Distributed Embedded Systems Wolfgang Haberl
- Model Analysis via a Translation Schema to Coloured Petri Nets
- Symposium on Theoretical Aspects of Computer Science 2010 (Nancy, France), pp. 359-370 www.stacs-conf.org
- Detecting Malicious Code by Model Checking Johannes Kinder, Stefan Katzenbeisser, Christian Schallhart, Helmut Veith
- Eine Fuzzy-Basis fur qualitative Bewegungsreprasentation
- arXiv:1012.2998v1[cs.PL]14Dec2010 On Probabilistic Parallel Programs with
- Kernel-Trick Large-Margin Klassifikatoren
- 184Roadmap Course Overview Introduction
- On Fixed Point Equations over Commutative Javier Esparza, Stefan Kiefer, and Michael Luttenberger
- Diskrete Strukturen I Ernst W. Mayr
- BAfoG Bescheinigungen Bescheinigung nach 48 --Diplom
- Compatibility and reuse in component-based systems via type and unit inference Christian Kuhnel1
- Information & Communications
- Slope Testing for Activity Diagrams and Safety Critical
- 3.1 Definitionen Diskrete Strukturen I
- TECHNISCHE UNIVERSITAT MUNCHEN Lehrstuhl fur Informatik VII
- Mind the Shapes: Abstraction Refinement Via Topology Invariants
- 1.6.2 Multiplikativitt und Erkennbarkeit + Der folgende nichtdet. endl. Automat (NFA) ber
- Technische Universitat Munchen Fakultat fur Informatik
- Typregeln fr den Bytecode Verifier (I) |st| < max, reg!n = Err
- Newtonian Program Analysis Javier Esparza, Stefan Kiefer, and Michael Luttenberger
- Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems
- Technische Universitat Fakultat fur Informatik
- 2.2 Morphismen Seien A = S, und ~A = ~S, ~ zwei Algebren mit derselben Signatur.
- Model Checking Probabilistic Pushdown Automata Javier Esparza
- Solving Monotone Polynomial Equations Javier Esparza, Stefan Kiefer, and Michael Luttenberger
- Reachability Analysis of Synchronized PA Ahmed Bouajjani
- Galois-Verbindung Gegeben seien zwei Verbnde (L, ) und (M, ). Ein Paar
- Compositional Termination Proofs for Multi-Threaded Programs
- Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
- A False History of True Concurrency: from Petri to Tools
- The Model-Checking Kit Claus Schroter, Stefan Schwoon and Javier Esparza
- Reachability Analysis of Multithreaded Software with Asynchronous Communication
- Fundamenta Informaticae 46 (2001) 117--na (PU) 1 Unfolding Based Algorithms for the Reachability Problem
- Diskrete Strukturen I Ernst W. Mayr
- Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances
- Journal on Satisfiability, Boolean Modeling and Computation 5 (2008) 27-56 Abstraction Refinement with Craig Interpolation and
- On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
- Montone Frameworks Monotoner Framework (L, F, Lab, F, E, , f)
- Komplexitatstheorie 2003 Problemset 2
- Static Analysis of Dynamic Communication Systems by Partner Abstraction
- A Modal-Logic Based Graph Abstraction Jorg Bauer2
- On the Convergence of Newton's Method for Monotone Systems of Polynomial Equations
- Specification and Verification of Dynamic Communication Systems Jorg Bauer (joba@cs.uni-sb.de)
- Probabilistic Abstractions with Arbitrary Javier Esparza and Andreas Gaiser
- Analysis of Dynamic Communicating Systems by Hierarchical Abstraction (Draft)
- Online Robot Learning by Reward and Punishment for a Mobile Robot Dejvuth Suwimonteerabuth, Prabhas Chongstitvatana
- Solving Fixed-Point Equations by Derivation Tree Javier Esparza and Michael Luttenberger
- Modifizierte Semantik (I) [x:=a] , , r [x A(a, )], r
- Rewriting Models of Boolean Programs Ahmed Bouajjani1 and Javier Esparza2
- arXiv:1104.3100v1[cs.DS]15Apr2011 On Stabilization in Herman's Algorithm
- Bachelor/Master Thesis: A Tool for Stochastic Real-Time Processes
- PD Dr. Martin Stetter, Siemens AG 1 Das lineare Modell
- Fundamenta Informaticae 113 (2011) 124 1 DOI 10.3233/FI-2011-600
- PD Dr. Martin Stetter, Siemens AG 1 Neuronale Verfahren zur Regression
- Problems and Exercises "Nichtsequentielle Systeme und nebenlaufige
- Student Project--Newton-Solver for Maximilian Schlund
- Technische Universitat Munchen Wintersemester 2004/05 Institut fur Informatik Diskrete Strukturen I
- DS 1, WS 04/05 Allgemeine VorbemerkungenAllgemeine Vorbemerkungen
- Skript zur Vorlesung Prof. Javier Esparza
- Diskrete Strukturen I Ernst W. Mayr
- Computing Least Fixed Points of Probabilistic Systems of Polynomials
- FAKULT AT F UR INFORMATIK DER TECHNISCHEN UNIVERSIT AT M UNCHEN
- Verification and Synthesis of OCL Constraints via Topology Analysis
- 1 Problem description: Let n be a natural number and denote by B the set {0, 1}. For u, v Bn
- Stabilization of Branching Queueing Networks Toms Brzdil1
- Ausdrcke des -Kalkls Abstraktion: x.N
- PD Dr. Martin Stetter, Siemens AG 1 Statistische und neuronale Lernverfahren
- Threader: A Constraint-Based Verifier for Multi-threaded Programs
- Reachability Analysis of Procedural Programs with Affine Integer Arithmetic
- Towards Resource Consumption-aware Programming
- 114Roadmap Course Overview Introduction
- PD Dr. Martin Stetter, Siemens AG 1 Neuronale Verfahren zur Regression
- Separation Logic + Superposition Calculus = Heap Theorem Prover
- Diskrete Strukturen I Ernst W. Mayr
- Fundamenta Informaticae ???(???) 10011027 1001 On the Complexity of Consistency and Complete State Coding for
- Technical Report FKI-242-00 Optimising Route Weighting in Telecommunication
- On the Convergence of Newton's Method for Monotone Systems of Polynomial Equations
- Ubungen zu "Nichtsequentielle Systeme und nebenlaufige
- Efficient Algorithms for Alternating Pushdown Systems with an Application to the
- Under consideration for publication in Theory and Practice of Logic Programming 1 Applying Prolog to Develop Distributed Systems
- Javier Esparza and Keijo Heljanko A Partial-Order Approach to Model Checking
- Problems and Exercises "Nichtsequentielle Systeme und nebenlaufige
- Multiobjective Modelbased Evolution Strategy Dany Meyer, Kratzer AG Mnchen
- On the Complexity of the Equivalence Problem for Probabilistic Automata
- Indian Calendar System Ashutosh K Gupta
- Abstrakte Interpretation von HAILSTONE [skip]1;..., {[n odd]}
- Complexity Results for 1-safe Nets Allan Cheng
- 1.3 Aktionsgraphen I. Einfache sequentielle Systeme
- Logical Methods in Computer Science Vol. 2 (1:2) 2006, pp. 131
- Lehrstuhl fr Theoretische Informatik und Grundlagen der Knstlichen Intelligenz
- Synthesis of Distributed Algorithms Using Asynchronous Automata
- Solving Monotone Polynomial Equations Javier Esparza, Stefan Kiefer, and Michael Luttenberger
- Komplexitatstheorie 2003 Problemset 1
- Malware Normalization Mihai Christodorescu
- CORPORATETECHNOLOGY Information &
- F R E E C H O I C E P E T R I N E T S Cambridge Tracts in Theoretical Computer Science
- Runtime Analysis of Probabilistic Programs with Unbounded Recursion
- Using Verification Technology to Specify and Detect Andreas Holzer, Johannes Kinder, and Helmut Veith
- Learning Workflow Petri Nets Javier Esparza, Martin Leucker, and Maximilian Schlund
- Software Transformations to Improve Malware Mihai Christodorescu1
- 1.8 Automaten ber unendlichen Wrtern (27./29.11.02, 7. Woche)
- Faculty of Informatics Masaryk University Brno
- Mathus Dejori, Siemens AG Structural learning of Bayesian networks
- Helsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 68
- 224Roadmap Course Overview Introduction
- F R E E C H O I C E P E T R I N E T S Cambridge Tracts in Theoretical Computer Science
- Model Checking LTL with Regular Valuations for Pushdown Systems1
- Technische Universitt Mnchen Fakultt fr Informatik
- Complexity of Pattern-based Verification for Multithreaded Programs
- Running COLA on Embedded Systems Wolfgang Haberl
- Technische Universitat Munchen Wintersemester 2004/05 Institut fur Informatik Diskrete Strukturen I
- Relational Analysis for Delivery of Services Flemming Nielson, Hanne Riis Nielson, Jorg Bauer, Christoffer Rosenkilde
- Derivation Tree Analysis for Accelerated Fixed-Point Computation
- On the Convergence of Newton's Method for Monotone Systems of Polynomial Equations
- PD Dr. Martin Stetter, Siemens AG 1 Statistische und neuronale Lernverfahren
- Mapping Data-Flow Dependencies onto Distributed Embedded Systems
- Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion
- Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
- Efficient Analysis of Probabilistic Programs with an Unbounded Counter
- R R U1 . . . Un
- Fundamenta Informaticae XX (2004) 123 1 A Polynomial-Time Algorithm for Checking Consistency of
- Diskrete Strukturen I Ernst W. Mayr
- CONVERGENCE THRESHOLDS OF NEWTON'S METHOD FOR MONOTONE POLYNOMIAL EQUATIONS
- PD Dr. Martin Stetter, Siemens AG 1 Lernen von Datenmodellen: Fehlerminimierung und Regularisierung
- Approximative Methods for Monotone Systems of min-max-Polynomial Equations
- On Fixed Point Equations over Commutative Javier Esparza, Stefan Kiefer, and Michael Luttenberger
- Universitat Stuttgart Institut fur Formale Methoden der Informatik
- Approximative Methods for Monotone Systems of min-max-Polynomial Equations
- Intelligent Exploration for Genetic Algorithms Using Self-Organizing Maps in Evolutionary Computation
- PD Dr. Martin Stetter, Siemens AG 1 Neuronale Lernverfahren fr Klassifikation
- Komplexitatstheorie 2004 Problemset 1
- Diskrete Strukturen I Ernst W. Mayr
- Technik: funktionelle Kernspintomographie ,,functional Magnetic Resonance Imaging" (fMRI)
- A Semantics for Procedure Local Heaps and its Abstractions
- I N S T I T U T F U R I N F O R M A T I K Compatibility and reuse in component-based
- PD Dr. Martin Stetter, Siemens AG 1 Optimierungsverfahren
- arXiv:submit/0006496[cs.NA]16Mar2010 Computing the Least Fixed Point
- 2. Automaten ber unendlichen Wrtern (Das ergnzt Kap. 2 aus dem Skript von A. Kiehn)
- Using Semantic Web Languages in Argumentation Models
- arXiv:1001.0340v2[cs.NA]12Jan2010 Computing the Least Fixed Point
- On Fixed Point Equations over Commutative Javier Esparza, Stefan Kiefer, and Michael Luttenberger
- Lehrstuhl fur Informatik VII der Technischen Universitat Munchen
- Don't care in SMT--Building flexible yet efficient abstraction/refinement solvers1
