Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
Journal of the ACM (JACM)
Synchronization of communicating processes
Communications of the ACM
Concurrent control with “readers” and “writers”
Communications of the ACM
Compact finite difference schemes for ocean models: 1. Ocean waves
Journal of Computational Physics
A Fundamental Tehoerem of Asynchronous Parallel Computation
Proceedings of the Sagamore Computer Conference on Parallel Processing
Correctness in operating systems
Correctness in operating systems
ACM Computing Surveys (CSUR)
Transition systems, infinitary languages and the semantics of uniform concurrency
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Delay-Independent Design for Distributed Systems
IEEE Transactions on Software Engineering
ECCS and LIPS: two languages for OSI systems specification and verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Liveness conditions in model-based service specifications: a case study
SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
IEEE Transactions on Software Engineering
Specification and verification of fault-tolerance, timing, and scheduling
ACM Transactions on Programming Languages and Systems (TOPLAS)
Requirements analysis using Petri nets
ACM '85 Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective
Semaphore primitives and starvation-free mutual exclusion
Journal of the ACM (JACM)
METASAN: a performability evaluation tool based on stochastic activity networks
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Parallel program verification with directed graphs
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
ACM Computing Surveys (CSUR)
Concepts and Notations for Concurrent Programming
ACM Computing Surveys (CSUR)
A New Approach to Proving the Correctness of Multiprocess Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Nonsequentiality and Concrete Activity Phases in Discrete-Event Simulation Languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The ``Hoare Logic'' of CSP, and All That
ACM Transactions on Programming Languages and Systems (TOPLAS)
A compiler for analyzing cryptographic protocols using noninterference
ACM Transactions on Software Engineering and Methodology (TOSEM)
Extending the SCR Method for Real-Time Systems
Real-Time Systems
Verification and design aspects of "true concurrency"
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Parallel program correctness through refinement
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Reasoning about nonatomic operations
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
Additive models of probabilistic processes
Theoretical Computer Science
Compositional Validation of Time-Critical Systems Using Communicating Time Petri Nets
IEEE Transactions on Software Engineering
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Theoretical Computer Science - Rewriting logic and its applications
Synthesising elementary net systems with inhibitor arcs from step transition systems
Fundamenta Informaticae - Application of concurrency to system design
Classification of Security Properties (Part I: Information Flow)
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
2-Nested Simulation Is Not Finitely Equationally Axiomatizable
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Lifting Temporal Proofs through Abstractions
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Compositional Verification of Randomized Distributed Algorithms
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Testing Hennessy-Milner Logic with Recursion
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Reasoning about Algebraic Generalisation of Petri Nets
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Survey of recent operating systems research, designs and implementations
ACM SIGOPS Operating Systems Review
Specification and verification of distributed systems using prolog interpreted petri nets.
ICSE '84 Proceedings of the 7th international conference on Software engineering
The two-step commitment protocol: Modeling, specification and proof methodology
ICSE '81 Proceedings of the 5th international conference on Software engineering
Specifying and proving properties of sentinel processes
ICSE '81 Proceedings of the 5th international conference on Software engineering
Direct architectural implementation of a requirements-oriented computing structure
MICRO 12 Proceedings of the 12th annual workshop on Microprogramming
A synthesis rule for concurrent systems
DAC '78 Proceedings of the 15th Design Automation Conference
Design and verification of communication procedures: A bottom-up approach
ICSE '78 Proceedings of the 3rd international conference on Software engineering
Consistency and correctness of duplicate database systems
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Modeling jobs in a distributed system
SIGSMALL '83 Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers
Functional specification of synchronized processes based on modal logic
ICSE '82 Proceedings of the 6th international conference on Software engineering
Behaviour model elaboration using partial labelled transition systems
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Extending distributed system specifications
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Incremental elaboration of scenario-based specifications and behavior models using implied scenarios
ACM Transactions on Software Engineering and Methodology (TOSEM)
Nested semantics over finite trees are equationally hard
Information and Computation
Merging partial behavioural models
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Model checking real-time value-passing systems
Journal of Computer Science and Technology
CCS with Hennessy's merge has no finite-equational axiomatization
Theoretical Computer Science - Expressiveness in concurrency
A foundation for behavioural conformance in software product line architectures
Proceedings of the ISSTA 2006 workshop on Role of software architecture for testing and analysis
Modelling, property verification and behavioural equivalence of lactose operon regulation
Computers in Biology and Medicine
Impossibility Results in the Equational Logic of Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
An Operational Semantics and Compiler for Real-Time Specifications
Integrated Computer-Aided Engineering
Structured Specification of Communicating Systems
IEEE Transactions on Computers
Hardware Specification with Temporal Logic: An Example
IEEE Transactions on Computers
REBUS, A Fault-Tolerant Distributed System for Industrial Real-Time Control
IEEE Transactions on Computers
Performance Analysis Using Stochastic Petri Nets
IEEE Transactions on Computers
MTSA: Eclipse support for modal transition systems construction, analysis and elaboration
Proceedings of the 2007 OOPSLA workshop on eclipse technology eXchange
A theoretical framework for multiple neural network systems
Neurocomputing
Compositional semantics and behavioral equivalences for P Systems
Theoretical Computer Science
Failure-free coordinators synthesis for component-based architectures
Science of Computer Programming
Deriving event-based transition systems from goal-oriented requirements models
Automated Software Engineering
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
25 Years of Model Checking
SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR
25 Years of Model Checking
Protocol Modeling with Model Program Composition
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Journal of Systems and Software
An architectural approach to the correct and automatic assembly of evolving component-based systems
Journal of Systems and Software
Synthesis of Elementary Net Systems with Context Arcs and Localities
Fundamenta Informaticae - PETRI NETS 2007
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
The Future of Software: Adaptation and Dependability
Software Engineering
On Trace-Expressible Behaviour of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
LTS semantics for use case models
Proceedings of the 2009 ACM symposium on Applied Computing
Probabilistic environments in the quantitative analysis of (non-probabilistic) behaviour models
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
A Sound Observational Semantics for Modal Transition Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Modelling mixed discrete-continuous domains for planning
Journal of Artificial Intelligence Research
Teaching Concurrency: Theory in Practice
TFM '09 Proceedings of the 2nd International Conference on Teaching Formal Methods
Synthesis of elementary net systems with context arcs and localities
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Pillars of computer science
Coordinating and visualizing independent behaviors in erlang
Proceedings of the 9th ACM SIGPLAN workshop on Erlang
Switching logic synthesis for reachability
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Synthesis of live behaviour models
Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering
Programming coordinated behavior in java
ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
Mediating connector patterns for components interoperability
ECSA'10 Proceedings of the 4th European conference on Software architecture
Some notes on the history of protocol engineering
Computer Networks: The International Journal of Computer and Telecommunications Networking
Alternating simulation and IOCO
ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems
Exploring inconsistencies between modal transition systems
Software and Systems Modeling (SoSyM)
A theory of mediators for eternal connectors
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
On-the-fly interoperability through automated mediator synthesis and monitoring
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Monitoring distributed systems using knowledge
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Synthesis of distributed control through knowledge accumulation
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
A semantic model for many-core parallel computing
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
SOCK: a calculus for service oriented computing
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
Weak Alphabet Merging of Partial Behavior Models
ACM Transactions on Software Engineering and Methodology (TOSEM)
Choreography and orchestration: a synergic approach for system design
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
Properties of behavioural model merging
FM'06 Proceedings of the 14th international conference on Formal Methods
Transition systems of elementary net systems with localities
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Finite equational bases in process algebra: results and open questions
Processes, Terms and Cycles
Choreography and orchestration conformance for system design
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Achieving distributed control through model checking
Formal Methods in System Design
Research: TESTGEN: An environment for protocol test suite generation and selection
Computer Communications
Synthesis of event-based controllers: a software engineering challenge
Proceedings of the 34th International Conference on Software Engineering
Integrating model checking and inductive logic programming
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
On Trace-Expressible Behaviour of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Synthesis of Elementary Net Systems with Context Arcs and Localities
Fundamenta Informaticae - PETRI NETS 2007
Synthesising Elementary Net Systems with Inhibitor Arcs from Step Transition Systems
Fundamenta Informaticae - Application of Concurrency to System Design
The Synthesis Problem for Elementary Net Systems with Inhibitor Arcs
Fundamenta Informaticae
A Game-Theoretic Analysis of Grid Job Scheduling
Journal of Grid Computing
The saga of the axiomatization of parallel composition
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Parameterized preorder relations for model-based testing of software product lines
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
From stack traces to lazy rewriting sequences
IFL'11 Proceedings of the 23rd international conference on Implementation and Application of Functional Languages
Achieving interoperability through semantics-based technologies: the instant messaging case
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part II
Controller synthesis: from modelling to enactment
Proceedings of the 2013 International Conference on Software Engineering
Generation of Java programs properties from test purposes
Proceedings of the 2013 International Symposium on Software Testing and Analysis
Empirical Software Engineering
A cylinder computation model for many-core parallel computing
Theoretical Computer Science
Merging partial behaviour models with different vocabularies
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Supporting incremental behaviour model elaboration
Computer Science - Research and Development
Supporting incremental behaviour model elaboration
Computer Science - Research and Development
Hi-index | 48.23 |
Two formal models for parallel computation are presented: an abstract conceptual model and a parallel-program model. The former model does not distinguish between control and data states. The latter model includes the capability for the representation of an infinite set of control states by allowing there to be arbitrarily many instruction pointers (or processes) executing the program. An induction principle is presented which treats the control and data state sets on the same ground. Through the use of “place variables,” it is observed that certain correctness conditions can be expressed without enumeration of the set of all possible control states. Examples are presented in which the induction principle is used to demonstrate proofs of mutual exclusion. It is shown that assertions-oriented proof methods are special cases of the induction principle. A special case of the assertions method, which is called parallel place assertions, is shown to be incomplete. A formalization of “deadlock” is then presented. The concept of a “norm” is introduced, which yields an extension, to the deadlock problem, of Floyd's technique for proving termination. Also discussed is an extension of the program model which allows each process to have its own local variables and permits shared global variables. Correctness of certain forms of implementation is also discussed. An Appendix is included which relates this work to previous work on the satisfiability of certain logical formulas.