Search results for "Reachability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
17	Thomas Colcombet	On Families of Graphs Having a Decidable First Order Theory with Reachability.	ICALP	2002	DBLP DOI BibTeX RDF
17	Rajeev Alur, Thao Dang 0001, Franjo Ivancic	Reachability Analysis of Hybrid Systems via Predicate Abstraction.	HSCC	2002	DBLP DOI BibTeX RDF
17	Michel Bidoit, Rolf Hennicker	On the Integration of Observability and Reachability Concepts.	FoSSaCS	2002	DBLP DOI BibTeX RDF
17	Jakob Rehof, Manuel Fähndrich	Type-base flow analysis: from polymorphic subtyping to CFL-reachability.	POPL	2001	DBLP DOI BibTeX RDF
17	Tak-John Koo, George J. Pappas, Shankar Sastry 0001	Mode Switching Synthesis for Reachability Specifications.	HSCC	2001	DBLP DOI BibTeX RDF
17	Dirk Beyer 0001	Efficient Reachability Analysis and Refinement Checking of Timed Automata Using BDDs.	CHARME	2001	DBLP DOI BibTeX RDF	Real-time systems, Formal verification, Timed Automata
17	Sherief Reda, Ayman Wahba, Ashraf Salem, Dominique Borrione, M. Ghonaimy	On the use of don't cares during symbolic reachability analysis.	ISCAS (5)	2001	DBLP DOI BibTeX RDF
17	Gianpiero Cabodi, Paolo Camurati, Stefano Quer	Improving symbolic reachability analysis by means of activityprofiles.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2000	DBLP DOI BibTeX RDF
17	Alexander B. Kurzhanski, Pravin Varaiya	Ellipsoidal Techniques for Reachability Analysis.	HSCC	2000	DBLP DOI BibTeX RDF
17	Parosh Aziz Abdulla, Per Bjesse, Niklas Eén	Symbolic Reachability Analysis Based on SAT-Solvers.	TACAS	2000	DBLP DOI BibTeX RDF
17	Oscar H. Ibarra, Tevfik Bultan, Jianwen Su	Reachability Analysis for Some Models of Infinite-State Transition Systems.	CONCUR	2000	DBLP DOI BibTeX RDF
17	Roberto M. Amadio, Denis Lugiez	On the Reachability Problem in Cryptographic Protocols.	CONCUR	2000	DBLP DOI BibTeX RDF	verification, cryptographic protocols, symbolic computation
17	Piotr Chrzastowski-Wachtel	Testing Undecidability of the Reachability in Petri Nets with the Help of 10th Hilbert Problem.	ICATPN	1999	DBLP DOI BibTeX RDF
17	Nisse Husberg, Tapio Manner	Emma: Developing an Industrial Reachability Analyser for SDL.	World Congress on Formal Methods	1999	DBLP DOI BibTeX RDF
17	Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes	Decidable Fragments of Simultaneous Rigid Reachability.	ICALP	1999	DBLP DOI BibTeX RDF
17	In-Ho Moon, James H. Kukula, Thomas R. Shiple, Fabio Somenzi	Least fixpoint approximations for reachability analysis.	ICCAD	1999	DBLP DOI BibTeX RDF
17	Keijo Heljanko	Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets.	TACAS	1999	DBLP DOI BibTeX RDF
17	Stavros Tripakis	Timed Diagnostics for Reachability Properties.	TACAS	1999	DBLP DOI BibTeX RDF
17	Sameer Sharma, Michael S. Hsiao	Partial Scan Using Multi-Hop State Reachability Analysis.	VTS	1999	DBLP DOI BibTeX RDF
17	Conrado Daws, Stavros Tripakis	Model Checking of Real-Time Reachability Properties Using Abstractions.	TACAS	1998	DBLP DOI BibTeX RDF
17	Michael S. Hsiao, Gurjeet S. Saund, Elizabeth M. Rudnick, Janak H. Patel	Partial Scan Selection Based on Dynamic Reachability and Observability Information.	VLSI Design	1998	DBLP DOI BibTeX RDF	test generation, DFT, partial scan
17	Shankar G. Govindaraju, David L. Dill, Alan J. Hu, Mark Horowitz	Approximate Reachability with BDDs Using Overlapping Projections.	DAC	1998	DBLP DOI BibTeX RDF	transceiver, spread spectrum communication, RF CMOS, digital radio, ISM frequency band
17	Burkhard Graves	Computing Reachability Properties Hidden in Finite Net Unfoldings.	FSTTCS	1997	DBLP DOI BibTeX RDF
17	Peter Kemper	Reachability Analysis Based on Structured Representations.	Application and Theory of Petri Nets	1996	DBLP DOI BibTeX RDF
17	Gianpiero Cabodi, Paolo Camurati, Stefano Quer	Improved reachability analysis of large finite state machines.	ICCAD	1996	DBLP DOI BibTeX RDF	Sequential Logic Synthesis and Verification
17	Shin'ichi Nagano, Yoshinori Hatakeyama, Yoshiaki Kakuda, Tohru Kikuno	Timed Reachability Analysis Method for EFSM-based Communication Protocols and Its Experimental Evaluation.	ICNP	1996	DBLP DOI BibTeX RDF
17	Thomas W. Reps, Susan Horwitz, Shmuel Sagiv	Precise Interprocedural Dataflow Analysis via Graph Reachability.	POPL	1995	DBLP DOI BibTeX RDF	C
17	Hong Liu 0004, Raymond E. Miller	Generalized fair reachability analysis for cyclic protocols with nondeterministic and internal transitions.	ICNP	1995	DBLP DOI BibTeX RDF
17	Angelo Monti, Alessandro Roncato	On the Complexity of Some Reachability Problems.	CIAC	1994	DBLP DOI BibTeX RDF
17	Jörg Desel, Javier Esparza	Shortest Paths in Reachability Graphs.	Application and Theory of Petri Nets	1993	DBLP DOI BibTeX RDF
17	Jörg Desel, Javier Esparza	Reachability in Reversible Free Choice Systems.	STACS	1991	DBLP DOI BibTeX RDF
17	Aline Deruyver, Rémi Gilleron	The Reachability Problem for Ground TRS and Some Extensions.	TAPSOFT, Vol.1	1989	DBLP DOI BibTeX RDF
17	Heiko Krumm	Projections of the Reachability Graph and Environment Models.	Automatic Verification Methods for Finite State Systems	1989	DBLP DOI BibTeX RDF
17	J. L. Lambert	Some Consequences of the Decidability of the Reachability Problem for Petri Nets.	European Workshop on Applications and Theory of Petri Nets	1987	DBLP DOI BibTeX RDF
17	Horst Müller	The reachability problem for VAS.	European Workshop on Applications and Theory in Petri Nets	1984	DBLP DOI BibTeX RDF
17	Greg Nelson	Verifying Reachability Invariants of Linked Structures.	POPL	1983	DBLP DOI BibTeX RDF
17	Horst Müller	Reachability Analysis with Assertion Systems.	Theoretical Computer Science	1981	DBLP DOI BibTeX RDF
13	Jiefeng Cheng, Jeffrey Xu Yu, Philip S. Yu	Graph Pattern Matching: A Join/Semijoin Approach.	IEEE Trans. Knowl. Data Eng.	2011	DBLP DOI BibTeX RDF	2-hop labeling, reachability joins, join/semijoin processing, Graph matching
13	Ernst Moritz Hahn, Gethin Norman, David Parker 0001, Björn Wachter, Lijun Zhang 0001	Game-based Abstraction and Controller Synthesis for Probabilistic Hybrid Systems.	QEST	2011	DBLP DOI BibTeX RDF	probabilistic hybrid systems, probabilistic reachability, long-run average, abstraction refinement, stochastic games, controller synthesis
13	Sadegh Esmaeil Zadeh Soudjani, Alessandro Abate	Adaptive Gridding for Abstraction and Verification of Stochastic Hybrid Systems.	QEST	2011	DBLP DOI BibTeX RDF	Stochastic Hybrid Systems, Reachability and Safety, Approximations, Markov Chains, Abstractions
13	Yunhuai Liu, Qian Zhang 0001, Lionel M. Ni	Opportunity-Based Topology Control in Wireless Sensor Networks.	IEEE Trans. Parallel Distributed Syst.	2010	DBLP DOI BibTeX RDF	Topology control transitional region network reachability
13	Richard H. Carver, Jeff Yu Lei	A Stateful Approach to Testing Monitors in Multithreaded Programs.	HASE	2010	DBLP DOI BibTeX RDF	monitor, concurrent programming, reachability testing
13	Muneer Masadeh, Sanabel Fathi Nimer, Ahmed Yassin Al-Dubai	The Effects of Network Density of a New Counter-based Broadcasting Scheme in Mobile Ad Hoc Networks.	CIT	2010	DBLP DOI BibTeX RDF	Counter-based, Broadcast storm problem, Delivery ratio, MANETs, Broadcast, Flooding, Reachability
13	Arunabha Sen, Sujogya Banerjee, Pavel Ghosh, Sudheendra Murthy, Hung Q. Ngo 0001	Brief announcement: on regenerator placement problems in optical networks.	SPAA	2010	DBLP DOI BibTeX RDF	regenerator placement, optical networks, lightpath, reachability graph
13	Zijiang Yang 0006, Chao Wang 0001, Aarti Gupta, Franjo Ivancic	Model checking sequential software programs via mixed symbolic analysis.	ACM Trans. Design Autom. Electr. Syst.	2009	DBLP DOI BibTeX RDF	composite symbolic formula, Model checking, binary decision diagram, reachability analysis, presburger arithmetic, image computation
13	Jonathan Billington, Cong Yuan	On Modelling and Analysing the Dynamic MANET On-Demand (DYMO) Routing Protocol.	Trans. Petri Nets Other Model. Concurr.	2009	DBLP DOI BibTeX RDF	DYMO, MANETs, Coloured Petri Nets, Reachability Analysis, On-Demand Routing
13	Jonathan Billington, Somsak Vanit-Anunchai, Guy Edward Gallasch	Parameterised Coloured Petri Net Channel Models.	Trans. Petri Nets Other Model. Concurr.	2009	DBLP DOI BibTeX RDF	Parameterized Protocol Channel Models, Datagram Congestion Control Protocol, Coloured Petri Nets, Reachability Analysis
13	Antti Valmari	Bisimilarity Minimization in O(m logn) Time.	Petri Nets	2009	DBLP DOI BibTeX RDF	Analysis of reachability graphs, verification of systems
13	Hassan Reza, Malvika Pimple, Varun Krishna, Jared Hildle	A Safety Analysis Method Using Fault Tree Analysis and Petri Nets.	ITNG	2009	DBLP DOI BibTeX RDF	forward and backward reachability analysis, Petri nets, safety critical systems, fault tree analysis
13	Ramzi Ben Salah, Marius Bozga, Oded Maler	Compositional timing analysis.	EMSOFT	2009	DBLP DOI BibTeX RDF	compositional generation, abstraction, timed automata, reachability analysis
13	Klaus Seyerlehner, Arthur Flexer, Gerhard Widmer	On the limitations of browsing top-N recommender systems.	RecSys	2009	DBLP DOI BibTeX RDF	catalog coverage, top-N recommender systems, browsing, reachability, long tail
13	Yasmina Abdeddaïm, Eugene Asarin, Mihaela Sighireanu	Simple Algorithm for Simple Timed Games.	TIME	2009	DBLP DOI BibTeX RDF	reachability games, temporal uncertainity, timed game automata, STNU
13	Ioannis Krommidas, Christos D. Zaroliagis	An experimental study of algorithms for fully dynamic transitive closure.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	reachability, Transitive closure, dynamic algorithm, path
13	Isil Dillig, Thomas Dillig, Eran Yahav, Satish Chandra 0001	The CLOSER: automating resource management in java.	ISMM	2008	DBLP DOI BibTeX RDF	higher-level resource, interest reachability, logical liveness, resource interest graph, resource management
13	Shuvendu K. Lahiri, Shaz Qadeer	Back to the future: revisiting precise program verification using SMT solvers.	POPL	2008	DBLP DOI BibTeX RDF	heap-manipulating programs, software verification, decision procedures, reachability, linked lists, SMT solvers
13	Sukanta Das, Biplab K. Sikdar	Characterization of Non-reachable States in Irreversible CAState Space.	ACRI	2008	DBLP DOI BibTeX RDF	Irreversible CA, non-reachable states, reachability tree, attractor
13	Chao Wang 0001, Zijiang Yang 0006, Franjo Ivancic, Aarti Gupta	Disjunctive image computation for software verification.	ACM Trans. Design Autom. Electr. Syst.	2007	DBLP DOI BibTeX RDF	Model checking, formal verification, binary decision diagram, reachability analysis, image computation
13	Gary Wassermann, Carl Gould 0001, Zhendong Su 0001, Premkumar T. Devanbu	Static checking of dynamically generated queries in database applications.	ACM Trans. Softw. Eng. Methodol.	2007	DBLP DOI BibTeX RDF	database queries, JDBC, Static checking, context-free language reachability
13	Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina	Parametric probabilistic transition systems for system design and analysis.	Formal Aspects Comput.	2007	DBLP DOI BibTeX RDF	Probabilistic non-repudiation protocol, Reachability, Parameters, Discrete-time Markov chains
13	David Greenfieldboyce, Jeffrey S. Foster	Type qualifier inference for java.	OOPSLA	2007	DBLP DOI BibTeX RDF	JQual, field-sensitivity, opaque, java, tracked, transparent, context-sensitivity, type qualifiers, readonly, mutable, context-free language reachability
13	Alexandre Hamez, Fabrice Kordon, Yann Thierry-Mieg, Fabrice Legond-Aubry	dmcG : A Distributed Symbolic Model Checker Based on GreatSPN.	ICATPN	2007	DBLP DOI BibTeX RDF	GreatSPN, Distributed Model Checking, Symbolic Reachability Graph
13	Satoshi Yamane	Theory and Practice of Probabilistic Timed Game for Embedded Systems.	ICESS	2007	DBLP DOI BibTeX RDF	game-theoretic approach, probabilistic timed game automaton, reachability game, formal specification, formal verification
13	Kimmo Varpaaniemi	On Stubborn Sets in the Verification of Linear Time Temporal Properties.	Formal Methods Syst. Des.	2005	DBLP DOI BibTeX RDF	reduced state space generation, stubborn sets, verification of LTL formulas, reachability analysis
13	Gianpiero Cabodi, Sergio Nocco, Stefano Quer	Are BDDs still alive within sequential verification?	Int. J. Softw. Tools Technol. Transf.	2005	DBLP DOI BibTeX RDF	Approximate-reachability, Model checking, Binary Decision Diagrams, Satisfiability solvers
13	Biplab K. Sikdar, Samir Roy, Debesh K. Das	A Degree-of-Freedom Based Synthesis Scheme for Sequential Machines with Enhanced BIST Quality and Reduced Area.	J. Electron. Test.	2005	DBLP DOI BibTeX RDF	emitability, FSM state encoding, reachability, degree-of-freedom
13	Biplab K. Sikdar, Arijit Sarkar, Samir Roy, Debesh K. Das	Synthesis of Testable Finite State Machine Through Decomposition.	Asian Test Symposium	2005	DBLP DOI BibTeX RDF	emitability, FSM state encoding, decomposition, reachability, degree-of-freedom
13	Jean-François Couchot, Alain Giorgetti, Nikolai Kosmatov	A uniform deductive approach for parameterized protocol safety.	ASE	2005	DBLP DOI BibTeX RDF	generalized substitutions, safety, assertion, symbolic model checking, reachability
13	Rajeev Alur, Sampath Kannan, Salvatore La Torre	Polyhedral Flows in Hybrid Automata.	Formal Methods Syst. Des.	2004	DBLP DOI BibTeX RDF	polyhedral dynamics, hybrid systems, reachability analysis
13	HoonSang Jin, Kavita Ravi, Fabio Somenzi	Fate and free will in error traces.	Int. J. Softw. Tools Technol. Transf.	2004	DBLP DOI BibTeX RDF	Reachability game, Model checking, Counterexample
13	Gwan-Hwan Hwang, Sheng-Jen Chang, Huey-Der Chu	Technology for Testing Nondeterministic Client/Server Database Applications.	IEEE Trans. Software Eng.	2004	DBLP DOI BibTeX RDF	database management system, Concurrent programming, client/server, reachability testing
13	Amit M. Paradkar, Tim Klinger	Automated Consistency and Completeness Checking of Testing Models for Interactive Systems.	COMPSAC	2004	DBLP DOI BibTeX RDF	Completeness Checking, Reachability, Consistency Checking
13	Hsu-Chun Yen, Lien-Po Yu	Dependability Analysis of a Class of Probabilistic Petri Nets.	PRDC	2004	DBLP DOI BibTeX RDF	probabilistic Petri net, verification, Controllability, self-stabilization, reachability
13	Glenn Bruns, Satish Chandra 0001	Searching for Points-To Analysis.	IEEE Trans. Software Eng.	2003	DBLP DOI BibTeX RDF	model checking, program analysis, reachability analysis, Points-to analysis
13	Ian M. Mitchell, Claire J. Tomlin	Overapproximating Reachable Sets by Hamilton-Jacobi Projections.	J. Sci. Comput.	2003	DBLP DOI BibTeX RDF	verification, projection, reachability, Hamilton-Jacobi equation
13	Surender Baswana, Ramesh Hariharan, Sandeep Sen	Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.	STOC	2002	DBLP DOI BibTeX RDF	BFS tree, decremental, reachability
13	Eric Y. T. Juan, Jeffrey J. P. Tsai, Tadao Murata, Yi Zhou	Reduction Methods for Real-Time Systems Using Delay Time Petri Nets.	IEEE Trans. Software Eng.	2001	DBLP DOI BibTeX RDF	net reduction, schedule, Real-time systems, Petri nets, deadlock, reachability, state explosion
13	Inhye Kang, Insup Lee 0001, Young-Si Kim	An Efficient State Space Generation for the Analysis of Real-Time Systems.	IEEE Trans. Software Eng.	2000	DBLP DOI BibTeX RDF	real-time systems analysis, state space minimization, Formal specification, timed automata, reachability analysis
13	Ireneusz Sierocki	A Feedback Transformation of the Planning Problems.	Appl. Algebra Eng. Commun. Comput.	1998	DBLP DOI BibTeX RDF	Planning problem, Reachability structure, Transformation, Feedback, Representation, Decomposition, Problem complexity
13	Ge-Ming Chiu, Kai-Shung Chen	Efficient Fault-Tolerant Multicast Scheme for Hypercube Multicomputers.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	routing capability, Fault tolerance, multicast, hypercubes, reachability, time optimality
13	Steven Gordon, Jonathan Billington	Analysing a Missile Simulator with Coloured Petri Nets.	Int. J. Softw. Tools Technol. Transf.	1998	DBLP DOI BibTeX RDF	Missile simulator design, Simulation, Distributed systems, Coloured Petri nets, Reachability analysis
13	Gianpiero Cabodi, Paolo Camurati, Stefano Quer	Auxiliary variables for BDD-based representation and manipulation of Boolean functions.	ACM Trans. Design Autom. Electr. Syst.	1998	DBLP DOI BibTeX RDF	finite state machines, binary decision diagrams, reachability analysis, functional decompositions
13	William Chan 0001, Richard J. Anderson, Paul Beame, David Notkin	Improving Efficiency of Symbolic Model Checking for State-Based System Requirements.	ISSTA	1998	DBLP DOI BibTeX RDF	TCAS II, partitioned transition relation, system requirements specification, formal verification, abstraction, binary decision diagrams, statecharts, reachability analysis, symbolic model checking, RSML
13	Marc Abrams	An Example of Deriving Performance Properties from a Visual Representation of Program Execution.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	timed progress graphs, performance evaluation, visualization, Petri nets, Parallel computation, computational geometry, mutual exclusion, reachability analysis, ray shooting
13	Patrice Godefroid, Doron A. Peled, Mark G. Staskauskas	Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs.	IEEE Trans. Software Eng.	1996	DBLP DOI BibTeX RDF	Formal methods, validation, concurrent programs, reachability analysis, automatic verification, partial-order methods
13	Peter Kemper	Numerical Analysis of Superposed GSPNs.	IEEE Trans. Software Eng.	1996	DBLP DOI BibTeX RDF	superposed GSPN, numerical solution algorithm for steady-state analysis tensor/Kronecker algebra, Markov process, decomposition, reachability analysis, Stochastic Petri net, structured representation
13	Amit Konar, Ajit K. Mandal	Uncertainty Management in Expert Systems Using Fuzzy Petri Nets.	IEEE Trans. Knowl. Data Eng.	1996	DBLP DOI BibTeX RDF	fuzzy belief, limitcycles, stability, expert systems, belief revision, nonmonotonic reasoning, reachability, Belief propagation, fuzzy Petri nets, uncertainty management
13	Matthew Andrews, Michael A. Bender, Lisa Zhang	New Algorithms for the Disk Scheduling Problem.	FOCS	1996	DBLP DOI BibTeX RDF	disk I/O performance, convex reachability function, disk head, 3/2-approximation algorithm, optimal tour, head scheduling, scheduling, polynomial time, disk scheduling, asymmetric Traveling Salesman Problem
13	Thomas W. Reps, Genevieve Rosay	Precise Interprocedural Chopping.	SIGSOFT FSE	1995	DBLP DOI BibTeX RDF	graph reachability, program chopping, realizable path, debugging, program slicing, interprocedural analysis, program dependence graph
13	Shing-Chi Cheung, Jeff Kramer	Tractable Dataflow Analysis for Distributed Systems.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	action dependency, history sets, pump control system, arbitrary loops, nondeterministic structures, synchronous communicating systems, distributed systems, software engineering, static analysis, distributed processing, program verification, reachability analysis, labeled transition systems, dataflow analysis, software development tools, distributed software engineering, worst-case complexity
13	Narayanan Krishnakumar, Arthur J. Bernstein	Bounded Ignorance: A Technique for Increasing Concurrency in a Replicated System.	ACM Trans. Database Syst.	1994	DBLP DOI BibTeX RDF	concurrency control, replication, integrity constraints, reachability analysis, serializability
13	Edith Cohen	Estimating the Size of the Transitive Closure in Linear Time	FOCS	1994	DBLP DOI BibTeX RDF	size-estimation algorithms, reachability information, query optimization, randomized algorithm, directed graphs, transitive closure, database applications, neighborhoods, linear time, fast matrix multiplication
13	Giovanni Chiola, Claude Dutheillet, Giuliana Franceschinis, Serge Haddad	Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	stochastic well-formed colored nets, SWN, stochastic high-level nets, syntactic restriction, model definition, Markovian performance evaluation, lumpability condition, performance evaluation, computational complexity, computational complexity, complexity, Petri net, Petri nets, performance modeling, multiprocessing systems, memory contention, symbolic reachability graph
13	Stavros S. Cosmadakis	Logical Reducibility and Monadic NP	FOCS	1993	DBLP DOI BibTeX RDF	syntactically restricted first-order reductions, logical reducibility, monadic NP, polynomial-time many-one reductions, directed reachability, encodings, first-order logic, NP-complete problems, relational structures
13	Gianfranco Ciardo, Raymond A. Marie, Bruno Sericola, Kishor S. Trivedi	Performability Analysis Using Semi-Markov Reard Processes.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	vanishing states elimination, fast transient states elimination, semi-Markov reward processes, zero reward nonabsorbing states, probabilistic switch, stiff Markov chains, performance evaluation, performability analysis, Markov processes, decomposition, stochastic Petri net, reachability graph
13	Dar-Tzen Peng, Kang G. Shin	Modeling of Concurrent Task Execution in a Distributed System for Real-Time Control.	IEEE Trans. Computers	1987	DBLP DOI BibTeX RDF	task flow graph (TFG), Activity selection, continuous-time Markov chain (CTMC), generalized stochastic Petri nets (GSPN), reachability analysis, real-time control, first passage time, communication primitives
13	Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa	Parametric inference of memory requirements for garbage collected languages.	ISMM	2010	DBLP DOI BibTeX RDF	live heap space analysis, peak memory consumption, garbage collection, java bytecode, low-level languages
13	Neha Rungta, Eric Mercer	Slicing and dicing bugs in concurrent programs.	ICSE (2)	2010	DBLP DOI BibTeX RDF	underapproximation, concurrency, abstraction-refinement
13	Stavros Tripakis	Checking timed Büchi automata emptiness on simulation graphs.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF	property-preserving abstractions, timed Büchi automata, model checking, Formal methods, specification languages
13	Hai-Bin Zhang, Zhen-Hua Duan	Symbolic Algorithmic Analysis of Rectangular Hybrid Systems.	J. Comput. Sci. Technol.	2009	DBLP DOI BibTeX RDF	model checking, temporal logic, hybrid systems, automata
13	Moez Krichen, Stavros Tripakis	Conformance testing for real-time systems.	Formal Methods Syst. Des.	2009	DBLP DOI BibTeX RDF	On-the-fly algorithms, Real-time systems, Test generation, Coverage, Timed automata, Conformance testing, Specification and verification, Partial observability