Search results for "Reachability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
26	Patricia Bouyer, Pierre-Alain Reynier, Serge Haddad	Extended Timed Automata and Time Petri Nets.	ACSD	2006	DBLP DOI BibTeX RDF	Conciseness, Timed Automata, Reachability Analysis, Time Petri Nets
26	Bixin Li, Yancheng Wang, Lili Yang	An Integrated Regression Testing Framework to Multi-Threaded Java Programs.	SET	2006	DBLP DOI BibTeX RDF	Regression testing, Multi-threaded program, Reachability testing
26	Jifeng He 0001, Dang Van Hung, Geguang Pu, Zongyan Qiu, Wang Yi 0001	Exploring optimal solution to hardware/software partitioning for synchronous model.	Formal Aspects Comput.	2005	DBLP DOI BibTeX RDF	Timed automata, Scheduling algorithm, Reachability, Hardware/software partitioning
26	Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav Bodík	Demand-driven points-to analysis for Java.	OOPSLA	2005	DBLP DOI BibTeX RDF	refinement, points-to analysis, demand-driven analysis, context-free language reachability
26	Yann Thierry-Mieg, Jean-Michel Ilié, Denis Poitrenaud	A Symbolic Symbolic State Space Representation.	FORTE	2004	DBLP DOI BibTeX RDF	Well-Formed Petri Nets, Symbolic Model-checking, Decision Diagrams, Symmetry Detection, Symbolic Reachability Graph
26	Annikka Aalto, Nisse Husberg, Kimmo Varpaaniemi	Automatic Formal Model Generation and Analysis of SDL.	SDL Forum	2003	DBLP DOI BibTeX RDF	state space explosion problem, SDL, reachability analysis, high-level Petri nets
26	Ugo A. Buy, Gaurav Singal	Toward Efficient Algorithms for Generating Compact Petri Nets from Labeled Transition Systems.	COMPSAC	2002	DBLP DOI BibTeX RDF	Petri net generation, Petri nets, concurrency, automatic verification, transition systems, reachability graph
26	Alain Finkel, Jérôme Leroux	How to Compose Presburger-Accelerations: Applications to Broadcast Protocols.	FSTTCS	2002	DBLP DOI BibTeX RDF	Presburger model checking, verification, acceleration, infinite-state systems, reachability set
26	Haoxun Chen, Hans-Michael Hanisch	Analysis of Hybrid Systems Based on Hybrid Net Condition/Event System Model.	Discret. Event Dyn. Syst.	2001	DBLP DOI BibTeX RDF	condition /event systems, state reachability analysis, Petri nets, hybrid systems, modular modeling
26	Nisse Husberg, Teemu Tynjälä, Kimmo Varpaaniemi	Modelling and Analysing the SDL Description of the ISDN-DSS1 Protocol.	ICATPN	2000	DBLP DOI BibTeX RDF	DSS1, SDL, reachability analysis, high-level Petri nets, protocol verification, ISDN
26	Fabiano Silva, Marcos A. Castilho, Luis Allan Künzle	Petriplan: A New Algorithm for Plan Generation (Preliminary Report).	IBERAMIA-SBIA	2000	DBLP DOI BibTeX RDF	Petri Nets, Integer Programming, Reachability, AI Planning
26	Jun Zhou, Kuo-Chung Tai	Deadlock Analysis of Client/Server Programs.	ICDCS	2000	DBLP DOI BibTeX RDF	client/server program, deadlock, labeled transition system, reachability graph
26	Mohamed Faouzi Atig, Tayssir Touili	Verifying Parallel Programs with Dynamic Communication Structures.	CIAA	2009	DBLP DOI BibTeX RDF
26	Minh D. Nguyen, Max Thalmaier, Markus Wedler, Jörg Bormann, Dominik Stoffel, Wolfgang Kunz	Unbounded Protocol Compliance Verification Using Interval Property Checking With Invariants.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2008	DBLP DOI BibTeX RDF
26	Vineet Kahlon	Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs.	LICS	2008	DBLP DOI BibTeX RDF	Model Checking, Concurrent Programs, Dataflow Analysis, Parameterized Systems, Pushdown Systems
26	Dejvuth Suwimonteerabuth, Javier Esparza, Stefan Schwoon	Symbolic Context-Bounded Analysis of Multithreaded Java Programs.	SPIN	2008	DBLP DOI BibTeX RDF
26	Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko	Finer Is Better: Abstraction Refinement for Rewriting Approximations.	RTA	2008	DBLP DOI BibTeX RDF
26	Frantisek Galcík	Centralized Communication in Radio Networks with Strong Interference.	SIROCCO	2008	DBLP DOI BibTeX RDF
26	Vesa Halava, Mika Hirvensalo	Improved matrix pair undecidability results.	Acta Informatica	2007	DBLP DOI BibTeX RDF
26	Thomas Ball, Orna Kupferman, Mooly Sagiv	Leaping Loops in the Presence of Abstraction.	CAV	2007	DBLP DOI BibTeX RDF
26	Giorgio Delzanno, Laurent Van Begin	On the Dynamics of PB Systems with Volatile Membranes.	Workshop on Membrane Computing	2007	DBLP DOI BibTeX RDF
26	Yohan Boichut, Thomas Genet	Feasible Trace Reconstruction for Rewriting Approximations.	RTA	2006	DBLP DOI BibTeX RDF
26	Yu Lei 0001, David Chenho Kung, Qizhi Ye	A Blocking-Based Approach to Protocol Validation.	COMPSAC (1)	2005	DBLP DOI BibTeX RDF
26	Venkatesh Mysore, Amir Pnueli	Refining the Undecidability Frontier of Hybrid Automata.	FSTTCS	2005	DBLP DOI BibTeX RDF
26	Marc Solé, Enric Pastor	Evaluating Symbolic Traversal Algorithms Applied to Asynchronous Concurrent Systems.	ACSD	2004	DBLP DOI BibTeX RDF
26	Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, Grégoire Sutre	Software Verification with BLAST.	SPIN	2003	DBLP DOI BibTeX RDF
26	Iovka Boneva, Jean-Marc Talbot	When Ambients Cannot Be Opened.	FoSSaCS	2003	DBLP DOI BibTeX RDF
26	Martin Hirzel, Amer Diwan, Johannes Henkel	On the usefulness of type and liveness accuracy for garbage collection and leak detection.	ACM Trans. Program. Lang. Syst.	2002	DBLP DOI BibTeX RDF	liveness accuracy, type accuracy, program analysis, leak detection, Conservative garbage collection
26	Dmitri A. Dolgov, Edmund H. Durfee	Satisficing strategies for resource-limited policy search in dynamic environments.	AAMAS	2002	DBLP DOI BibTeX RDF
26	Martin Hirzel, Amer Diwan, Antony L. Hosking	On the Usefulness of Liveness for Garbage Collection and Leak Detection.	ECOOP	2001	DBLP DOI BibTeX RDF
26	Andreas Hett, Christoph Scholl 0001, Bernd Becker 0001	Distance driven finite state machine traversal.	DAC	2000	DBLP DOI BibTeX RDF
26	Catherine Dufourd, Alain Finkel	Polynomial-Time Manz-One Reductions for Petri Nets.	FSTTCS	1997	DBLP DOI BibTeX RDF
26	Hong Liu 0004, Raymond E. Miller	Partial-Order Validation for Multi-Process Protocols Modeled as Communicating Finite State Machines.	ICNP	1996	DBLP DOI BibTeX RDF
26	Bengt Jonsson 0001, Lars Kempe	Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms.	CAV	1995	DBLP DOI BibTeX RDF
26	Peter Buchholz 0001	Hierarchical High Level Petri Nets for Complex System Analysis.	Application and Theory of Petri Nets	1994	DBLP DOI BibTeX RDF
26	Uriel Feige	A Fast Randomized LOGSPACE Algorithm for Graph Connectivity.	ICALP	1994	DBLP DOI BibTeX RDF
24	Rachid Hadjidj, Hanifa Boucheneb	Efficient Reachability Analysis for Time Petri Nets.	IEEE Trans. Computers	2011	DBLP DOI BibTeX RDF	time Petri nets (TPN), state class spaces, reachability properties, model checking, Formal methods
24	Miroslav Svéda, Ondrej Rysavý, Gayan de Silva, Petr Matousek, Jaroslav Ráb	Reachability Analysis in Dynamically Routed Networks.	ECBS	2011	DBLP DOI BibTeX RDF	network reachability, routing protocols, network design, IP-networks, network configuration
24	Parisa Heidari, Hanifa Boucheneb	Efficient Method for Checking the Existence of a Safety/ Reachability Controller for Time Petri Nets.	ACSD	2010	DBLP DOI BibTeX RDF	on-the-fly algorithm, reachability properties, time Petri nets, safety properties, controller synthesis
24	Amir R. Khakpour, Alex X. Liu	Quantifying and Querying Network Reachability.	ICDCS	2010	DBLP DOI BibTeX RDF	Network Reachability, firewalls, network configuration, Access control lists, Network Access Control
24	Derrick Stolee, Chris Bourke, N. V. Vinodchandran	A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources.	CCC	2010	DBLP DOI BibTeX RDF	acyclic digraph, logspace algorithm, planar graph, reachability
24	Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kramer	Verification of Liveness Properties Using Compositional Reachability Analysis.	ESEC / SIGSOFT FSE	1997	DBLP DOI BibTeX RDF	Bu¨chi automata, reachability analysis, labelled transition systems, distributed computing systems, compositional verification, liveness properties
24	Amit Narayan, Adrian J. Isles, Jawahar Jain, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli	Reachability analysis using partitioned-ROBDDs.	ICCAD	1997	DBLP DOI BibTeX RDF	ROBDD, Verification, Partitioning, Reachability, FSM, Symbolic, Sequential, Traversal
24	Felice Balarin	Approximate reachability analysis of timed automata.	RTSS	1996	DBLP DOI BibTeX RDF	approximate reachability analysis, unsafe states, incorrect system, discrete state components, real-time systems, formal verification, Boolean functions, computation, timed automata, finite automata, finite state automata, timing information
24	Miklós Ajtai, Ronald Fagin	Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version)	FOCS	1988	DBLP DOI BibTeX RDF	efficiency of algorithms, undirected finite graphs, Ehrenfeucht-Fraisse games, directed graphs, reachability
23	Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamaric	A low-level memory model and an accompanying reachability predicate.	Int. J. Softw. Tools Technol. Transf.	2009	DBLP DOI BibTeX RDF
23	Colas Le Guernic, Antoine Girard	Reachability Analysis of Hybrid Systems Using Support Functions.	CAV	2009	DBLP DOI BibTeX RDF
23	Alexander Markowetz, Yin Yang 0001, Dimitris Papadias	Reachability Indexes for Relational Keyword Search.	ICDE	2009	DBLP DOI BibTeX RDF
23	Kristoffer Arnsfelt Hansen, Michal Koucký 0001, Peter Bro Miltersen	Winning Concurrent Reachability Games Requires Doubly-Exponential Patience.	LICS	2009	DBLP DOI BibTeX RDF
23	Radu Grosu	Finite Automata as Time-Inv Linear Systems Observability, Reachability and More.	HSCC	2009	DBLP DOI BibTeX RDF
23	Bakhadyr Khoussainov, Jiamou Liu, Imran Khaliq	A Dynamic Algorithm for Reachability Games Played on Trees.	MFCS	2009	DBLP DOI BibTeX RDF
23	Thomas Thierauf, Fabian Wagner	Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space.	FCT	2009	DBLP DOI BibTeX RDF
23	Ehab Al-Shaer, Wilfredo Marrero, Adel El-Atawy, Khalid Elbadawi	Network Configuration in A Box: Towards End-to-End Verification of Network Reachability and Security.	ICNP	2009	DBLP DOI BibTeX RDF
23	Silvio do Lago Pereira, Leliane Nunes de Barros	A logic-based agent that plans for extended reachability goals.	Auton. Agents Multi Agent Syst.	2008	DBLP DOI BibTeX RDF	Model checking, Temporal logic, Automated planning
23	Zhijun Ding, Changjun Jiang, MengChu Zhou	Deadlock Checking for One-Place Unbounded Petri Nets Based on Modified Reachability Trees.	IEEE Trans. Syst. Man Cybern. Part B	2008	DBLP DOI BibTeX RDF
23	Anthony Widjaja To, Leonid Libkin	Recurrent Reachability Analysis in Regular Model Checking.	LPAR	2008	DBLP DOI BibTeX RDF
23	Yangjun Chen	On the Evaluation of Large and Sparse Graph Reachability Queries.	DEXA	2008	DBLP DOI BibTeX RDF
23	Sumit Kumar Jha 0001	d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata.	HSCC	2008	DBLP DOI BibTeX RDF
23	Antoine Girard, Colas Le Guernic	Zonotope/Hyperplane Intersection for Hybrid Systems Reachability Analysis.	HSCC	2008	DBLP DOI BibTeX RDF
23	Jerry Ding, Jonathan Sprinkle, S. Shankar Sastry, Claire J. Tomlin	Reachability calculations for automated aerial refueling.	CDC	2008	DBLP DOI BibTeX RDF
23	Alessandro Abate, Maria Prandini, John Lygeros, Shankar Sastry 0001	An approximate dynamic programming approach to probabilistic reachability for stochastic hybrid systems.	CDC	2008	DBLP DOI BibTeX RDF
23	Naoki Tateishi, Mitsuho Tahara, Yu Miyoshi, Souhei Majima	Methods for Rapidly Testing Node Reachability with Congestion Control and Evaluation.	APNOMS	2008	DBLP DOI BibTeX RDF
23	Luis I. Aguirre-Salas, Alejandra Santoyo-Sanchez	Observability analysis of interpreted Petri nets under partial state observations using estimations reachability graph.	ETFA	2008	DBLP DOI BibTeX RDF
23	Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic 0001, Michal Rutkowski	Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets.	FORMATS	2008	DBLP DOI BibTeX RDF
23	Warren Schudy	Finding strongly connected components in parallel using o(log2n) reachability queries.	SPAA	2008	DBLP DOI BibTeX RDF	transitive closure bottleneck, parallel algorithms, graph algorithms, strongly connected components, topological sort
23	Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin 0001, Haixun Wang, Philip S. Yu	Fast computing reachability labelings for large graphs with high compression rate.	EDBT	2008	DBLP DOI BibTeX RDF
23	Chao Wang 0001, Zijiang Yang 0006, Aarti Gupta, Franjo Ivancic	Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra.	CAV	2007	DBLP DOI BibTeX RDF
23	Sean Safarpour, Andreas G. Veneris, Hratch Mangassarian	Trace Compaction using SAT-based Reachability Analysis.	ASP-DAC	2007	DBLP DOI BibTeX RDF
23	Sumit Kumar Jha 0001, Bruce H. Krogh, James E. Weimer, Edmund M. Clarke	Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction.	HSCC	2007	DBLP DOI BibTeX RDF
23	Matthew Hague, C.-H. Luke Ong	Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems.	FoSSaCS	2007	DBLP DOI BibTeX RDF
23	Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding	Cost-Based Query Optimization for Multi Reachability Joins.	DASFAA	2007	DBLP DOI BibTeX RDF
23	Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamaric	A Reachability Predicate for Analyzing Low-Level Software.	TACAS	2007	DBLP DOI BibTeX RDF
23	Guillem Godoy, Eduard Huntingford	Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems.	RTA	2007	DBLP DOI BibTeX RDF
23	Antonio de la Oliva, Marcelo Bagnulo, Alberto García-Martínez, Ignacio Soto	Performance Analysis of the REAchability Protocol for IPv6 Multihoming.	NEW2AN	2007	DBLP DOI BibTeX RDF	REAP, failure detection, multihoming, SHIM6
23	Susmit Jha, Bryan A. Brady, Sanjit A. Seshia	Symbolic Reachability Analysis of Lazy Linear Hybrid Automata.	FORMATS	2007	DBLP DOI BibTeX RDF
23	Bogdan Aman, Gabriel Ciobanu	On the Reachability Problem in P Systems with Mobile Membranes.	Workshop on Membrane Computing	2007	DBLP DOI BibTeX RDF
23	Husain Aljazzar, Stefan Leue	Extended Directed Search for Probabilistic Timed Reachability.	FORMATS	2006	DBLP DOI BibTeX RDF
23	Yacine Zemali	Controlled Reachability Analysis in AI Planning: Theory and Practice.	KI	2005	DBLP DOI BibTeX RDF
23	Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer, David L. Dill	A New Reachability Algorithm for Symmetric Multi-processor Architecture.	ATVA	2005	DBLP DOI BibTeX RDF
23	Fuzhi Wang, Marta Z. Kwiatkowska	An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata.	ATVA	2005	DBLP DOI BibTeX RDF
23	Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Shmuel Sagiv, Siddharth Srivastava 0001, Greta Yorsh	Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures.	CADE	2005	DBLP DOI BibTeX RDF
23	Domenico Cantone, Calogero G. Zarba	A Tableau-Based Decision Procedure for a Fragment of Graph Theory Involving Reachability and Acyclicity.	TABLEAUX	2005	DBLP DOI BibTeX RDF
23	Atsushi Ohta, Kohkichi Tsuji, Tomiji Hisamura	Minimal time reachability problem of some subclasses of timed Petri nets.	ISCAS (1)	2005	DBLP DOI BibTeX RDF
23	Prasanna Thati, José Meseguer 0001	Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing.	CALCO	2005	DBLP DOI BibTeX RDF
23	Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim	Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming.	CPAIOR	2004	DBLP DOI BibTeX RDF
23	Gianfranco Ciardo	Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?	ICATPN	2004	DBLP DOI BibTeX RDF
23	Rajeev Alur, Mikhail Bernadsky, P. Madhusudan	Optimal Reachability for Weighted Timed Games.	ICALP	2004	DBLP DOI BibTeX RDF
23	Alexei Lisitsa 0001, Igor Potapov	Membership and Reachability Problems for Row-Monomial Transformations.	MFCS	2004	DBLP DOI BibTeX RDF
23	Thomas Bourdeaud'huy, Pascal Yim, Saïd Hanafi	Efficient reachability analysis of bounded Petri nets using constraint programming.	SMC (2)	2004	DBLP DOI BibTeX RDF
23	Olfa Belkahla Driss, Pascal Yim, Ouajdi Korbaa, Khaled Ghédira	Reachability search in timed Petri nets using constraint programming.	SMC (5)	2004	DBLP DOI BibTeX RDF
23	Wee Kheng Leow, Siau-Cheng Khoo, Tiong Hoe Loh, Vivy Suhendra	Heuristic Search with Reachability Tests for Automated Generation of Test Programs.	ASE	2004	DBLP DOI BibTeX RDF
23	Ahmed Bouajjani, Antoine Meyer	Symbolic Reachability Analysis of Higher-Order Context-Free Processes.	FSTTCS	2004	DBLP DOI BibTeX RDF
23	William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Yang 0006, Marek A. Perkowski	Quantum logic synthesis by symbolic reachability analysis.	DAC	2004	DBLP DOI BibTeX RDF	model checking, formal verification, quantum computing, satisfiability, reversible logic
23	Ashish Tiwari 0001	Approximate Reachability for Linear Systems.	HSCC	2003	DBLP DOI BibTeX RDF
23	Ventsi G. Rumchev	Positive Linear Systems Reachability Criterion in Digraph Form.	POSTA	2003	DBLP DOI BibTeX RDF
23	Agata Pólrola, Wojciech Penczek, Maciej Szreter	Towards Efficient Partition Refinement for Checking Reachability in Timed Automata.	FORMATS	2003	DBLP DOI BibTeX RDF
23	Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick	Reachability and distance queries via 2-hop labels.	SODA	2002	DBLP BibTeX RDF
23	Ehab Al-Shaer, Yongning Tang	SMRM: SNMP-based multicast reachability monitoring.	NOMS	2002	DBLP DOI BibTeX RDF
23	Catalin Dima	Computing Reachability Relations in Timed Automata.	LICS	2002	DBLP DOI BibTeX RDF
23	Inseok Hwang 0002, Hamsa Balakrishnan, Ronojoy Ghosh, Claire J. Tomlin	Reachability Analysis of Delta-NotchLateral Inhibition Using Predicate Abstraction.	HiPC	2002	DBLP DOI BibTeX RDF