Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs
IEEE Transactions on Software Engineering - Special issue: best papers of the 1996 international symposium on software testing and analysis ISSTA'96
Model checking for programming languages using VeriSoft
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using shape analysis to reduce finite-state models of concurrent Java programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
Partial-Order Reduction in Symbolic State-Space Exploration
Formal Methods in System Design - Special issue on CAV '97
Relaxed Visibility Enhances Partial Order Reduction
Formal Methods in System Design
An Efficient Partial Order Reduction Algorithm with an Alternative Proviso Implementation
Formal Methods in System Design
Minimizing the number of successor states in the stubborn set method
Fundamenta Informaticae
Symmetry Reduction Criteria for Software Model Checking
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Dynamic Bounds and Transition Merging for Local First Search
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
On Combining the Persistent Sets Method with the Covering Steps Graph Method
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
A Compositional Sweep-Line State Space Exploration Method
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
A Sweep-Line Method for State Space Exploration
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Compositional Message Sequence Charts
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Black Box Unfolding with Local First Search
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Partial Order Reduction for Model Checking of Timed Automata
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Local First Search - A New Paradigm for Partial Order Reductions
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A Generalised Sweep-Line Method for Safety Properties
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
On-the-Fly Verification of Linear Temporal Logic
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Finding Stubborn Sets of Coloured Petri Nets Without Unfolding
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
On Stubborn Sets in the Verification of Linear Time Temporal Properties
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Stubborn Sets for Standard Properties
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Detection of Illegal Behaviors Based on Unfoldings
Proceedings of the 20th 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
Compressing Transitions for Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Handbook of automated reasoning
Partial-Order Methods for Model Checking: From Linear Time to Branching Time
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Locally linear time temporal logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Athena: a New Efficient Automatic Checker for Security Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
SAT-Solving the Coverability Problem for Petri Nets
Formal Methods in System Design
Journal of Computer Science and Technology
Implementing Coloured Petri Nets Using a Functional Programming Language
Higher-Order and Symbolic Computation
Dynamic partial-order reduction for model checking software
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On Stubborn Sets in the Verification of Linear Time Temporal Properties
Formal Methods in System Design
Software Model Checking: The VeriSoft Approach
Formal Methods in System Design
Reduced Models for Efficient CCS Verification
Formal Methods in System Design
Exploiting predicate structure for efficient reachability detection
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
A partial order semantics approach to the clock explosion problem of timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
More efficient on-the-fly LTL verification with Tarjan's algorithm
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Using heuristic search for finding deadlocks in concurrent systems
Information and Computation
Symbolic model checking of UML activity diagrams
ACM Transactions on Software Engineering and Methodology (TOSEM)
Automatic test case generation for UML activity diagrams
Proceedings of the 2006 international workshop on Automation of software test
Question-guided stubborn set methods for state properties
Formal Methods in System Design
DELFIN+: An efficient deadlock detection tool for CCS processes
Journal of Computer and System Sciences
Narrowing Petri Net State Spaces Using the State Equation
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Permutation rewriting and algorithmic verification
Information and Computation
Formal Verification of Simulation Traces Using Computation Slicing
IEEE Transactions on Computers
Formal Verification of Concurrent Systems via Directed Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reduction for Rewriting Semantics of Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Effective random testing of concurrent programs
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Symbolic model checking for temporal-epistemic logics
ACM SIGACT News
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Verifying Multi-threaded C Programs with SPIN
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Reconciling statechart semantics
Science of Computer Programming
Partial Order Reduction for State/Event LTL
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Dynamic Path Reduction for Software Model Checking
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Race analysis for SystemC using model checking
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
Model Checking and Artificial Intelligence
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Reduction of Verification Conditions for Concurrent System Using Mutually Atomic Transactions
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Subsumer-First: Steering Symbolic Reachability Analysis
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Slicing-based Reductions for Rebeca
Electronic Notes in Theoretical Computer Science (ENTCS)
Exploring the Scope for Partial Order Reduction
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Quantitative Analysis under Fairness Constraints
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Modeling and Model Checking Web Services
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reduction for Probabilistic Branching Time
Electronic Notes in Theoretical Computer Science (ENTCS)
Using heuristic search for finding deadlocks in concurrent systems
Information and Computation
Race analysis for systemc using model checking
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Designing a LTL model-checker based on unfolding graphs
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Improved question-guided stubborn set methods for state properties
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
On combining partial order reduction with fairness assumptions
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
A race-detection and flipping algorithm for automated testing of multi-threaded programs
HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
Unfolding concurrent well-structured transition systems
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Generating Petri net state spaces
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
The ComBack method: extending hash compaction with backtracking
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Some solutions to the ignoring problem
Proceedings of the 14th international SPIN conference on Model checking software
Cartesian partial-order reduction
Proceedings of the 14th international SPIN conference on Model checking software
Partial order reduction for verification of real-time components
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Peephole partial order reduction
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Actor-based slicing techniques for efficient reduction of Rebeca models
Science of Computer Programming
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Journal of Systems and Software
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Bounded parametric model checking for elementary net systems
Transactions on Petri nets and other models of concurrency IV
Parametric model checking with verICS
Transactions on Petri nets and other models of concurrency IV
Confluence reduction for probabilistic systems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Boosting lazy abstraction for systemc with partial order reduction
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Partial order reduction for state/event LTL with application to component-interaction automata
Science of Computer Programming
On combining state space reductions with global fairness assumptions
FM'11 Proceedings of the 17th international conference on Formal methods
On the origin of events: branching cells as stubborn sets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Fully symbolic model checking for timed automata
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
The BMC method for the existential part of RTCTLK and interleaved interpreted systems
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
Partial order reduction for markov decision processes: a survey
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
On reduction criteria for probabilistic reward models
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
On the computation of stubborn sets of colored petri nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Stronger reduction criteria for local first search
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Model checking of systems employing commutative functions
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Symbolic model checking for asynchronous boolean programs
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Symbolic partial order reduction for rule based transition systems
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Time-bounded analysis of real-time systems
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Transparent partial order reduction
Formal Methods in System Design
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Timed unfoldings for networks of timed automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
The implementation of mazurkiewicz traces in POEM
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Automated systematic testing of open distributed programs
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
Designing fast LTL model checking algorithms for many-core GPUs
Journal of Parallel and Distributed Computing
Symbolic model checking for temporal-epistemic logic
Logic Programs, Norms and Action
On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties
Science of Computer Programming
Guaranteeing Weak Termination in Service Discovery
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
TransDPOR: a novel dynamic partial-order reduction technique for testing actor programs
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Mechanized extraction of topology anti-patterns in wireless networks
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Stubborn sets for simple linear time properties
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Minimizing the Number of Successor States in the Stubborn Set Method
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Narrowing Petri Net State Spaces Using the State Equation
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Improving Partial Order Reductions for Universal Branching Time Properties
Fundamenta Informaticae
Analyzing and Reducing Simultaneous Firing in Signal-Event Nets
Fundamenta Informaticae
Stable Models for Stubborn Sets
Fundamenta Informaticae
Deadlock-freedom in component systems with architectural constraints
Formal Methods in System Design
Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Detecting temporal logic predicates on distributed computations
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Partial orders for efficient bounded model checking of concurrent software
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Distributed LTL Model Checking with Hash Compaction
Electronic Notes in Theoretical Computer Science (ENTCS)
Confluence reduction for markov automata
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Optimal dynamic partial order reduction
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Autonomous Agents and Multi-Agent Systems
On combining the ready sets with the covering steps methods
International Journal of Critical Computer-Based Systems
A Sweep-Line Method for Büchi Automata-based Model Checking
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |