A time abstraction method for efficient verification of communicating systems
DAC '94 Proceedings of the 31st annual Design Automation Conference
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Three logics for branching bisimulation
Journal of the ACM (JACM)
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Synthesis of concurrent systems with many similar processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Improving efficiency of symbolic model checking for state-based system requirements
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Decoupling synchronization from local control for efficient symbolic model checking of statecharts
Proceedings of the 21st international conference on Software engineering
Optimizing Symbolic Model Checking for Statecharts
IEEE Transactions on Software Engineering - Special issue on 1999 international conference on software engineering
Efficient Detection of Vacuity in Temporal Model Checking
Formal Methods in System Design - Special issue on CAV '97
Synthesis of concurrent programs for an atomic read/write model of computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of propositional linear temporal logics in simple cases
Information and Computation
Formula-Dependent Equivalence for Compositional CTL Model Checking
Formal Methods in System Design
Verification of timed automata based on similarity
Fundamenta Informaticae
Abstraction in Software Model Checking: Principles and Practice (Tutorial Overview and Bibliography)
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Coverage Metrics for Temporal Logic Model Checking
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Branching vs. Linear Time: Final Showdown
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model Checking Modal Transition Systems Using Kripke Structures
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Lifting Temporal Proofs through Abstractions
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Performance Evaluation: = (Process Algebra + Model Checking) × Markov Chains
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Simulation for Continuous-Time Markov Chains
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Compositional Reasoning in Model Checking
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
The State Explosion Problem from Trace to Bisimulation Equivalence
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Graded Modalities and Resource Bisimulation
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Faithful Translations among Models and Specifications
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Linking Theorem Proving and Model-Checking with Well-Founded Bisimulation
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Model Checking with Formula-Dependent Abstract Models
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A Partial Order Method for the Verification of Time Petri Nets
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Automated Verification of Infinite State Concurrent Systems
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
On the expressivity and complexity of quantitative branching-time temporal logics
Theoretical Computer Science - Latin American theoretical informatics
Handbook of automated reasoning
An Abstraction Algorithm for the Verification of Level-Sensitive Latch-Based Netlists
Formal Methods in System Design
From Pre-Historic to Post-Modern Symbolic Model Checking
Formal Methods in System Design
Probabilistic weak simulation is decidable in polynomial time
Information Processing Letters
Static Analysis for State-Space Reductions Preserving Temporal Logics
Formal Methods in System Design
On model checking data-independent systems with arrays without reset
Theory and Practice of Logic Programming
A theory of normed simulations
ACM Transactions on Computational Logic (TOCL)
Applicability of fair simulation
Information and Computation
Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
Theoretical Computer Science - Special issue: Computational systems biology
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Comparative branching-time semantics for Markov chains
Information and Computation
The coarsest congruence for timed automata with deadlines contained in bisimulation
CONCUR 2005 - Concurrency Theory
Stuttering Abstraction for Model Checkin
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Symbolic model checking of UML activity diagrams
ACM Transactions on Software Engineering and Methodology (TOSEM)
A complete compositional reasoning framework for the efficient verification of pipelined machines
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Feature interaction detection by pairwise analysis of LTL properties: a case study
Formal Methods in System Design
Combining symmetry reduction and under-approximation for symbolic model checking
Formal Methods in System Design
Computer Networks: The International Journal of Computer and Telecommunications Networking
Invariance under stuttering in a temporal logic of actions
Theoretical Computer Science
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
On Designated Values in Multi-valued CTL^* Model Checking
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Minimization Algorithms for Time Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Backward Bisimulation in Markov Chain Model Checking
IEEE Transactions on Software Engineering
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
Algebraic Stuttering Simulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Path Compression in Timed Automata
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Invariance Under Stuttering in a Temporal Logic without the "Until" Operator
Fundamenta Informaticae
Theoretical Computer Science
An automatic abstraction technique for verifying featured, parameterised systems
Theoretical Computer Science
The Challenge of Hardware-Software Co-verification
Verified Software: Theories, Tools, Experiments
25 Years of Model Checking
Reconciling statechart semantics
Science of Computer Programming
Translation of Intermediate Language to Timed Automata with Discrete Data
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A theory of mutations with applications to vacuity, coverage, and fault tolerance
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
A refinement-based compositional reasoning framework for pipelined machine verification
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Bisimilarity Minimization in O(m logn) Time
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Computing Stuttering Simulations
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
An efficient simulation algorithm based on abstract interpretation
Information and Computation
Enhancing Test Coverage by Back-tracing Model-checker Counterexamples
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic numeric abstractions for heap-manipulating programs
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comparative branching-time semantics for Markov chains
Information and Computation
Applicability of fair simulation
Information and Computation
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Simple representative instantiations for multicast protocols
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
State class constructions for branching analysis of time Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Branching vs. linear time: semantical perspective
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
An invariant-based approach to the verification of asynchronous parameterized networks
Journal of Symbolic Computation
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Lossy counter machines decidability cheat sheet
RP'10 Proceedings of the 4th international conference on Reachability problems
Folk theorems on the correspondence between state-based and event-based systems
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Reduction of interrupt handler executions for model checking embedded software
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Stuttering mostly speeds up solving parity games
NFM'11 Proceedings of the Third international conference on NASA Formal methods
On the composition of time Petri nets
Discrete Event Dynamic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Game-theoretic simulation checking tool
Programming and Computing Software
Robust Vacuity for Branching Temporal Logic
ACM Transactions on Computational Logic (TOCL)
Abstraction and refinement in model checking
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
An abstract interpretation perspective on linear vs. branching time
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
An abstract interpretation-based refinement algorithm for strong preservation
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A categorical approach to simulations
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Refinement and theorem proving
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
State space reduction of rewrite theories using invisible transitions
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Smaller abstractions for ∀CTL* without next
Concurrency, Compositionality, and Correctness
Simulation-Based graph similarity
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automatica (Journal of IFAC)
Invariance Under Stuttering in a Temporal Logic without the "Until" Operator
Fundamenta Informaticae
Translation of Intermediate Language to Timed Automata with Discrete Data
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Path Compression in Timed Automata
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
On Designated Values in Multi-valued CTL^* Model Checking
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Minimization Algorithms for Time Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Verification of Timed Automata Based on Similarity
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Improving Partial Order Reductions for Universal Branching Time Properties
Fundamenta Informaticae
The Inherent Difficulty of Timely Primary-Backup Replication
Bell Labs Technical Journal
A cure for stuttering parity games
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Optimizing abstract abstract machines
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
LTL receding horizon control for finite deterministic systems
Automatica (Journal of IFAC)
| Hi-index | 0.01 |