Schedulers as abstract interpretations of higher-dimensional automata
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
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
Synchronizations in Team Automata for Groupware Systems
Computer Supported Cooperative Work
Towards Formal Specification and Verification in Cyberspace
FAABS '00 Proceedings of the First International Workshop on Formal Approaches to Agent-Based Systems-Revised Papers
Compositional Transformational Design for Concurrent Programs
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Efficient Model Checking of Causal-Knowledge Protocols
CEEMAS '01 Revised Papers from the Second International Workshop of Central and Eastern Europe on Multi-Agent Systems: From Theory to Practice in Multi-Agent Systems
Synthesizing Distributed Transition Systems from Global Specification
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Lightweight consistency analysis of dataflow process networks
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Bounding Average Time Separations of Events in Stochastic Timed Petri Nets with Choice
ASYNC '99 Proceedings of the 5th International Symposium on Advanced Research in Asynchronous Circuits and Systems
An algebraic characterization of independence of Petri net processes
Information Processing Letters - Special issue: Contribution to computing science
Concurrent computing machines and physical space-time
Mathematical Structures in Computer Science
On the classification of dipaths in geometric models for concurrency
Mathematical Structures in Computer Science
On the semantics of place/transition Petri nets
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
A set-theoretic framework for component composition
Fundamenta Informaticae
Knowledge and the ordering of events in distributed systems: extended abstract
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
Keeping track of the latest gossip in a distributed system
Distributed Computing
Proving refinement using transduction
Distributed Computing - Special issue: Verification of lazy caching
A practical application of geometric semantics to static analysis of concurrent programs
CONCUR 2005 - Concurrency Theory
Exploiting predicate structure for efficient reachability detection
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Automated Online Monitoring of Distributed Applications through External Monitors
IEEE Transactions on Dependable and Secure Computing
Towards a Framework for Modelling Systems with Rich Internal Structures of States and Processes
Fundamenta Informaticae
An Axiomatic Characterization of Algebras of Processes of Petri Nets
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Concurrent Logic and Automata Combined: A Semantics for Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Producing Short Counterexamples Using "Crucial Events"
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Test case generation for ultimately periodic paths
HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
A Boolean Algebra of Contracts for Assume-guarantee Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
Transaction Scripts: Making Implicit Scenarios Explicit
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata for Epistemic Temporal Logic with Synchronous Communication
Journal of Logic, Language and Information
Modal logic over higher dimensional automata
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Automating cut-off for multi-parameterized systems
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Fully symbolic model checking for timed automata
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Relativistic Causality and Clockless Circuits
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Formal Methods in Software and Systems Modeling
Deciding properties of message sequence charts
SMTT'03 Proceedings of the 2003 international conference on Scenarios: models, Transformations and Tools
BEST: A symbolic testing tool for predicting multi-threaded program failures
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Scalable and precise symbolic analysis for atomicity violations
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Multiplicative Transition Systems
Fundamenta Informaticae
An Axiomatic Characterization of Algebras of Processes of Petri Nets
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Towards a Framework for Modelling Systems with Rich Internal Structures of States and Processes
Fundamenta Informaticae
A Set-Theoretic Framework for Component Composition
Fundamenta Informaticae
On Topological Hierarchies of Temporal Properties
Fundamenta Informaticae
A Concurrent Functional Semantics for a Process Algebra Based on Action Systems
Fundamenta Informaticae
AXIOMATIZATIONS OF TEMPORAL LOGICS ON TRACE SYSTEMS
Fundamenta Informaticae
ON FOUR PARTIAL ORDERING SEMANTICS FOR A PROCESS CALCULUS
Fundamenta Informaticae
| Hi-index | 0.00 |