Skip header Section
Skip Bibliometrics Section
Communication and concurrencyJanuary 1989
- Author:
- R. Milner
Abstract
No abstract available.
Cited By
Majumdar R, Ozay N and Schmuck A On abstraction-based controller design with output feedback Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control, (1-11)- Alur R and Tripakis S (2017). Automatic Synthesis of Distributed Protocols, ACM SIGACT News, 48:1, (55-90), Online publication date: 10-Mar-2017.
- Etchevers X, Salaün G, Boyer F, Coupaye T and DeźPalma N (2019). Reliable self-deployment of distributed cloud applications, Software—Practice & Experience, 47:1, (3-20), Online publication date: 1-Jan-2017.
- Plotkin G, Bjørner N, Lopes N, Rybalchenko A and Varghese G (2016). Scaling network verification using symmetry and surgery, ACM SIGPLAN Notices, 51:1, (69-83), Online publication date: 8-Apr-2016.
- Plotkin G, Bjørner N, Lopes N, Rybalchenko A and Varghese G Scaling network verification using symmetry and surgery Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (69-83)
- Jepsen J and Kindler E The Event Coordination Notation Revised Selected Papers of the International Workshops on Behavior Modeling -- Foundations and Applications - Volume 6368, (133-164)
- Rungger M and Tabuada P Abstracting and refining robustness for cyber-physical systems Proceedings of the 17th international conference on Hybrid systems: computation and control, (223-232)
- Szpyrka M, Matyasik P, Mrówka R and Kotulski L (2019). Formal Description of Alvis Language with α0 System Layer, Fundamenta Informaticae, 129:1-2, (161-176), Online publication date: 1-Jan-2014.
- Hillston J, Marin A, Rossi S and Piazza C Contextual lumpability Proceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools, (194-203)
- Ciancia V, Martinelli F, Matteucci I, Petrocchi M, Martín J and Pimentel E A tool for the synthesis of cryptographic orchestrators Proceedings of the Workshop on Model-Driven Security, (1-6)
- Monjaraz R and Mariño J From the π-calculus to flat GHC Proceedings of the 14th symposium on Principles and practice of declarative programming, (163-172)
- Prabhakar P, Dullerud G and Viswanathan M Pre-orders for reasoning about stability Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control, (197-206)
- Bergstra J and Middelburg C (2019). On the Behaviours Produced by Instruction Sequences under Execution, Fundamenta Informaticae, 120:2, (111-144), Online publication date: 1-Apr-2012.
- Yordanov B, Appleton E, Ganguly R, Gol E, Carr S, Bhatia S, Haddock T, Belta C and Densmore D Experimentally driven verification of synthetic biological circuits Proceedings of the Conference on Design, Automation and Test in Europe, (236-241)
- Jeffrey A LTL types FRP Proceedings of the sixth workshop on Programming languages meets program verification, (49-60)
- Santone A Clone detection through process algebras and Java bytecode Proceedings of the 5th International Workshop on Software Clones, (73-74)
- Mishra S, Kushwaha D and Misra A (2011). Hybrid reliable load balancing with MOSIX as middleware and its formal verification using process algebra, Future Generation Computer Systems, 27:5, (506-526), Online publication date: 1-May-2011.
- Martinho J and Ravara A (2011). Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation, Journal of Automated Reasoning, 46:3-4, (293-323), Online publication date: 1-Apr-2011.
- Bergstra J and Middelburg C (2019). An Interface Group for Process Components, Fundamenta Informaticae, 99:4, (355-382), Online publication date: 1-Dec-2010.
- Charguéraud A (2010). Program verification through characteristic formulae, ACM SIGPLAN Notices, 45:9, (321-332), Online publication date: 27-Sep-2010.
- Charguéraud A Program verification through characteristic formulae Proceedings of the 15th ACM SIGPLAN international conference on Functional programming, (321-332)
- van Amstel M, van den Brand M and Engelen L An exercise in iterative domain-specific language design Proceedings of the Joint ERCIM Workshop on Software Evolution (EVOL) and International Workshop on Principles of Software Evolution (IWPSE), (48-57)
- Sewell P, Wojciechowski P and Unyapoth A (2010). Nomadic pict, ACM Transactions on Programming Languages and Systems, 32:4, (1-63), Online publication date: 1-Apr-2010.
- Cook W On understanding data abstraction, revisited Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications, (557-572)
- Cook W (2009). On understanding data abstraction, revisited, ACM SIGPLAN Notices, 44:10, (557-572), Online publication date: 25-Oct-2009.
- Cortés H, García M, Hernández J, Hernández M, Pérez-Cordoba E and Ramos E Development of a distributed system applied to teaching and learning Proceedings of the 8th ACM SIGPLAN workshop on ERLANG, (41-50)
- Bugliesi M, Macedonio D, Pino L and Rossi S Compliance preorders for web services Proceedings of the 6th international conference on Web services and formal methods, (76-91)
- Krka I, Brun Y, Edwards G and Medvidovic N Synthesizing partial component-level behavior models from system specifications Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering, (305-314)
- Combéfis S and Pecheur C A bisimulation-based approach to the analysis of human-computer interaction Proceedings of the 1st ACM SIGCHI symposium on Engineering interactive computing systems, (101-110)
- Larsen K A MuDDy Experience---ML Bindings to a BDD Library Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages, (45-57)
- Gromov M, El-Fakih K, Shabaldina N and Yevtushenko N Distinguing Non-deterministic Timed Finite State Machines Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems, (137-151)
- Kühnrich M and Nestmann U On Process-Algebraic Proof Methods for Fault Tolerant Distributed Systems Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems, (198-212)
- Hinze R Reasoning about codata Proceedings of the Third summer school conference on Central European functional programming school, (42-93)
- Duggan D and Wu Y Causality and Accountability Formal Aspects in Security and Trust, (82-96)
- Frau S, Gorrieri R and Ferigato C Petri Net Security Checker Formal Aspects in Security and Trust, (210-225)
- Bravetti M and Zavattaro G (2019). A Foundational Theory of Contracts for Multi-party Service Composition, Fundamenta Informaticae, 89:4, (451-478), Online publication date: 31-Jan-2009.
- Balicki K and Szpyrka M (2019). Formal Definition of XCCS Modelling Language, Fundamenta Informaticae, 93:1-3, (1-15), Online publication date: 1-Jan-2009.
- Balicki K and Szpyrka M (2019). Formal Definition of XCCS Modelling Language, Fundamenta Informaticae, 93:1-3, (1-15), Online publication date: 1-Jan-2009.
- Bravetti M and Zavattaro G (2019). A Foundational Theory of Contracts for Multi-party Service Composition, Fundamenta Informaticae, 89:4, (451-478), Online publication date: 1-Dec-2008.
- Aceto L, Fokkink W and Ingolfsdottir A (2019). A Cancellation Theorem for BCCSP, Fundamenta Informaticae, 88:1-2, (1-21), Online publication date: 1-Dec-2008.
- Fokkink W, Pang J and Wijs A (2019). Is Timed Branching Bisimilarity a Congruence Indeed?, Fundamenta Informaticae, 87:3-4, (287-311), Online publication date: 30-Nov-2008.
- Barbuti R, Maggiolo-Schettini A, Milazzo P and Tini S (2019). A P Systems Flat Form Preserving Step-by-step Behaviour, Fundamenta Informaticae, 87:1, (1-34), Online publication date: 1-Nov-2008.
- Yu J, Han Y, Han J, Jin Y, Falcarin P and Morisio M (2008). Synthesizing service composition models on the basis of temporal business rules, Journal of Computer Science and Technology, 23:6, (885-894), Online publication date: 1-Nov-2008.
- McEwan A and Woodcock J Unifying theories of interrupts Proceedings of the 2nd international conference on Unifying theories of programming, (122-141)
- Fokkink W, Pang J and Wijs A (2008). Is Timed Branching Bisimilarity a Congruence Indeed?, Fundamenta Informaticae, 87:3-4, (287-311), Online publication date: 1-Aug-2008.
- Behrends E, Fritzen O, May W and Schenk F (2019). Embedding Event Algebras and Process for ECA Rules for the Semantic Web, Fundamenta Informaticae, 82:3, (237-263), Online publication date: 1-Aug-2008.
- Behrends E, Fritzen O, May W and Schenk F (2019). Embedding Event Algebras and Process for ECA Rules for the Semantic Web, Fundamenta Informaticae, 82:3, (237-263), Online publication date: 15-Jul-2008.
- Bergstra J and Middelburg C (2019). Maurer Computers with Single-Thread Control, Fundamenta Informaticae, 80:4, (333-362), Online publication date: 1-Apr-2008.
- Braun C, Chatzikokolakis K and Palamidessi C Compositional methods for information-hiding Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures, (443-457)
- Rangel G, König B and Ehrig H Deriving bisimulation congruences in the presence of negative application conditions Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures, (413-427)
- Antonik A, Huth M, Larsen K, Nyman U and Wąsowski A Complexity of decision problems for mixed and modal specifications Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures, (112-126)
- Pommereau F Quickly prototyping petri nets tools with SNAKES Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops, (1-10)
- Barbuti R, Maggiolo-Schettini A, Milazzo P and Tini S (2019). A P Systems Flat Form Preserving Step-by-step Behaviour, Fundamenta Informaticae, 87:1, (1-34), Online publication date: 1-Jan-2008.
- Huang X, Jiao L and Lu W Weak parametric failure equivalences and their congruence formats Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77, (15-26)
- Bergstra J and Middelburg C (2019). Maurer Computers with Single-Thread Control, Fundamenta Informaticae, 80:4, (333-362), Online publication date: 1-Dec-2007.
- Hughes A A framework for mobile Java applications Proceedings of the 5th international symposium on Principles and practice of programming in Java, (243-248)
- Mathaikutty D, Patel H, Shukla S and Jantsch A (2008). EWD, ACM Transactions on Design Automation of Electronic Systems, 12:3, (1-43), Online publication date: 17-Aug-2007.
- Amadio R and Dabrowski F Feasible reactivity in a synchronous Π-calculus Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming, (221-230)
- Groote J and Voorhoeve M (2007). Operational semantics for Petri net components, Theoretical Computer Science, 379:1-2, (1-19), Online publication date: 1-Jul-2007.
- Killian C, Anderson J, Braud R, Jhala R and Vahdat A Mace Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation, (179-188)
- Killian C, Anderson J, Braud R, Jhala R and Vahdat A (2007). Mace, ACM SIGPLAN Notices, 42:6, (179-188), Online publication date: 10-Jun-2007.
- Nejati S, Sabetzadeh M, Chechik M, Easterbrook S and Zave P Matching and Merging of Statecharts Specifications Proceedings of the 29th international conference on Software Engineering, (54-64)
- Yi J and Zhang W Enhancing simulation for checking language containment Proceedings of the 4th international conference on Theory and applications of models of computation, (374-385)
- Danos V, Krivine J and Tarissan F (2007). Self-assembling Trees, Electronic Notes in Theoretical Computer Science (ENTCS), 175:1, (19-32), Online publication date: 1-May-2007.
- Francalanza A and Hennessy M A fault tolerance bisimulation proof for consensus Proceedings of the 16th European Symposium on Programming, (395-410)
- Lapadula A, Pugliese R and Tiezzi F A calculus for orchestration of web services Proceedings of the 16th European Symposium on Programming, (33-47)
- Wimmer R, Herbstritt M and Becker B Optimization techniques for BDD-based bisimulation computation Proceedings of the 17th ACM Great Lakes symposium on VLSI, (405-410)
- Priami C Computational thinking in biology Transactions on computational systems biology VIII, (63-76)
- Zhang X and Zhang W CCML Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology, (109-112)
- Bozzelli L, Křetínský M, Řehák V and Strejček J On decidability of LTL model checking for process rewrite systems Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science, (248-259)
- Philippou A and Michael G Verification techniques for distributed algorithms Proceedings of the 10th international conference on Principles of Distributed Systems, (172-186)
- Li J, He J, Pu G and Zhu H Towards the semantics for web service choreography description language Proceedings of the 8th international conference on Formal Methods and Software Engineering, (246-263)
- Heckel R, Lajios G and Menge S (2019). Stochastic Graph Transformation Systems, Fundamenta Informaticae, 74:1, (63-84), Online publication date: 31-Oct-2006.
- Miculan M and Bacci G Modal logics for brane calculus Proceedings of the 2006 international conference on Computational Methods in Systems Biology, (1-16)
- Roy C, Noll T, Roy B and Cordy J Towards automatic verification of Erlang programs by π-calculus translation Proceedings of the 2006 ACM SIGPLAN workshop on Erlang, (38-50)
- Alferes J, Banti F and Brogi A An event-condition-action logic programming language Proceedings of the 10th European conference on Logics in Artificial Intelligence, (29-42)
- Varacca D, Völzer H and Winskel G (2006). Probabilistic event structures and domains, Theoretical Computer Science, 358:2, (173-199), Online publication date: 7-Aug-2006.
- Aceto L, Chen T, Fokkink W and Ingolfsdottir A On the axiomatizability of priority Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II, (480-491)
- Williams S, Battle S and Cuadrado J Protocol mediation for adaptation in semantic web services Proceedings of the 3rd European conference on The Semantic Web: research and applications, (635-649)
- Jančar P and Srba J Undecidability results for bisimilarity on prefix rewrite systems Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures, (277-291)
- Phillips I and Ulidowski I Reversing algebraic process calculi Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures, (246-260)
- Dam M (2006). Decidability and proof systems for language-based noninterference relations, ACM SIGPLAN Notices, 41:1, (67-78), Online publication date: 12-Jan-2006.
- Dam M Decidability and proof systems for language-based noninterference relations Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (67-78)
- Heckel R, Lajios G and Menge S (2019). Stochastic Graph Transformation Systems, Fundamenta Informaticae, 74:1, (63-84), Online publication date: 1-Jan-2006.
- Kahramanoğulları O (2006). System BV is NP-complete, Electronic Notes in Theoretical Computer Science (ENTCS), 143, (87-99), Online publication date: 1-Jan-2006.
- Křetínský M, Řehák V and Strejček J Reachability of hennessy-milner properties for weakly extended PRS Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science, (213-224)
- Lang F Exp.Open 2.0 Proceedings of the 5th international conference on Integrated Formal Methods, (70-88)
- Malik R and Roop P Adaptive techniques for specification matching in embedded systems Proceedings of the 5th international conference on Integrated Formal Methods, (33-52)
- Kiehn A and Arun-Kumar S Amortised bisimulations Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems, (320-334)
- Noll T and Roy C Modeling Erlang in the pi-calculus Proceedings of the 2005 ACM SIGPLAN workshop on Erlang, (72-77)
- McDermott J Visual security protocol modeling Proceedings of the 2005 workshop on New security paradigms, (97-109)
- Dittmar A and Forbrig P A unified description formalism for complex HCI-systems Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods, (342-351)
- Mateescu R On-the-fly state space reductions for weak equivalences Proceedings of the 10th international workshop on Formal methods for industrial critical systems, (80-89)
- Sánchez C, Sipma H, Slanina M and Manna Z Final semantics for event-pattern reactive programs Proceedings of the First international conference on Algebra and Coalgebra in Computer Science, (364-378)
- Mitchell B (2005). Resolving Race Conditions in Asynchronous Partial Order Scenarios, IEEE Transactions on Software Engineering, 31:9, (767-784), Online publication date: 1-Sep-2005.
- Verdejo A and Martí-Oliet N (2005). Two case studies of semantics execution in Maude, Formal Methods in System Design, 27:1-2, (113-172), Online publication date: 1-Sep-2005.
- Núñez M, Rodríguez I and Rubio F (2005). Formal specification of multi-agent e-barter systems, Science of Computer Programming, 57:2, (187-216), Online publication date: 1-Aug-2005.
- Alferes J and May W Evolution and reactivity for the web Proceedings of the First international conference on Reasoning Web, (134-172)
- Fritz C and Wilke T (2005). Simulation relations for alternating Büchi automata, Theoretical Computer Science, 338:1-3, (275-314), Online publication date: 10-Jun-2005.
- Fu Y (2005). On quasi-open bisimulation, Theoretical Computer Science, 338:1-3, (96-126), Online publication date: 10-Jun-2005.
- Pucella R (2005). Logical verification and equational verification, ACM SIGACT News, 36:2, (77-88), Online publication date: 1-Jun-2005.
- Borgström J and Nestmann U (2018). On bisimulations for the spi calculus, Mathematical Structures in Computer Science, 15:3, (487-552), Online publication date: 1-Jun-2005.
- Manolios P and Srinivasan S A complete compositional reasoning framework for the efficient verification of pipelined machines Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, (863-870)
- Busi N and Zavattaro G Prioritized and parallel reactions in shared data space coordination languages Proceedings of the 7th international conference on Coordination Models and Languages, (204-219)
- Deng Y, Palamidessi C and Pang J Compositional reasoning for probabilistic finite-state behaviors Processes, Terms and Cycles, (309-337)
- Bagherzadeh M and Arun-Kumar S A multi-agent framework based on communication and concurrency Proceedings of the 6th international conference on Distributed Computing, (114-125)
- Uchitel S and Chechik M (2004). Merging partial behavioural models, ACM SIGSOFT Software Engineering Notes, 29:6, (43-52), Online publication date: 1-Nov-2004.
- Uchitel S and Chechik M Merging partial behavioural models Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering, (43-52)
- Bartels F, Sokolova A and de Vink E (2004). A hierarchy of probabilistic system types, Theoretical Computer Science, 327:1-2, (3-22), Online publication date: 25-Oct-2004.
- Hennessy M, Merro M and Rathke J (2004). Towards a behavioural theory of access and mobility control in distributed systems, Theoretical Computer Science, 322:3, (615-669), Online publication date: 6-Sep-2004.
- Busi N and Zavattaro G (2004). On the expressive power of movement and restriction in pure mobile ambients, Theoretical Computer Science, 322:3, (477-515), Online publication date: 6-Sep-2004.
- Kristensen L and Christensen S (2019). Implementing Coloured Petri Nets Using a Functional Programming Language, Higher-Order and Symbolic Computation, 17:3, (207-243), Online publication date: 1-Sep-2004.
- Chaki S, Clarke E, Groce A, Ouaknine J, Strichman O and Yorav K (2019). Efficient Verification of Sequential and Concurrent C Programs, Formal Methods in System Design, 25:2-3, (129-166), Online publication date: 1-Sep-2004.
- Bossi A, Piazza C and Rossi S Unwinding conditions for security in imperative languages Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation, (85-100)
- Bouyer P, Dufourd C, Fleury E and Petit A (2004). Updatable timed automata, Theoretical Computer Science, 321:2-3, (291-345), Online publication date: 16-Aug-2004.
- Janin D and Lenzi G (2019). On the Rlationship Between Monadic and Weak Monadic Second Order Logic on Arbitrary Trees, with Applications to the mu-Calculus, Fundamenta Informaticae, 61:3-4, (247-265), Online publication date: 1-Aug-2004.
- Braghin C and Piazza C (2004). Checking Integrity via CoPS and Banana, Electronic Notes in Theoretical Computer Science (ENTCS), 99, (295-317), Online publication date: 1-Aug-2004.
- Bossi A, Focardi R, Macedonio D, Piazza C and Rossi S (2004). Unwinding in Information Flow Security, Electronic Notes in Theoretical Computer Science (ENTCS), 99, (127-154), Online publication date: 1-Aug-2004.
- Balsamo S, Di Marco A, Inverardi P and Simeoni M (2004). Model-Based Performance Prediction in Software Development, IEEE Transactions on Software Engineering, 30:5, (295-310), Online publication date: 1-May-2004.
- Roychoudhury A and Ramakrishnan I (2019). Inductively Verifying Invariant Properties of Parameterized Systems, Automated Software Engineering, 11:2, (101-139), Online publication date: 1-Apr-2004.
- Muccini H, Bertolino A and Inverardi P (2004). Using Software Architecture for Code Testing, IEEE Transactions on Software Engineering, 30:3, (160-171), Online publication date: 1-Mar-2004.
- Gorrieri R and Martinelli F (2004). A simple framework for real-time cryptographic protocol analysis with compositional proof rules, Science of Computer Programming, 50:1-3, (23-49), Online publication date: 1-Mar-2004.
- Baier C, Hermanns H and Katoen J (2004). Probabilistic weak simulation is decidable in polynomial time, Information Processing Letters, 89:3, (123-130), Online publication date: 14-Feb-2004.
- Mosses P (2019). Exploiting Labels in Structural Operational Semantics, Fundamenta Informaticae, 60:1-4, (17-31), Online publication date: 1-Jan-2004.
- Nicol D, Sanders W and Trivedi K (2004). Model-Based Evaluation, IEEE Transactions on Dependable and Secure Computing, 1:1, (48-65), Online publication date: 1-Jan-2004.
- Janin D and Lenzi G (2019). On the relationship between monadic and weak monadic second order logic on arbitrary trees, with applications to the mu-calculus, Fundamenta Informaticae, 61:3,4, (247-265), Online publication date: 1-Dec-2003.
- Ferrari G, Gnesi S, Montanari U and Pistore M (2003). A model-checking verification environment for mobile processes, ACM Transactions on Software Engineering and Methodology (TOSEM), 12:4, (440-473), Online publication date: 1-Oct-2003.
- Mosses P (2019). Exploiting Labels in Structural Operational Semantics, Fundamenta Informaticae, 60:1-4, (17-31), Online publication date: 1-Sep-2003.
- Mehta N and Medvidovic N (2003). Composing architectural styles from architectural primitives, ACM SIGSOFT Software Engineering Notes, 28:5, (347-350), Online publication date: 1-Sep-2003.
- Giannakopoulou D and Magee J (2003). Fluent model checking for event-based systems, ACM SIGSOFT Software Engineering Notes, 28:5, (257-266), Online publication date: 1-Sep-2003.
- Uchitel S, Kramer J and Magee J (2003). Behaviour model elaboration using partial labelled transition systems, ACM SIGSOFT Software Engineering Notes, 28:5, (19-27), Online publication date: 1-Sep-2003.
- Mehta N and Medvidovic N Composing architectural styles from architectural primitives Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering, (347-350)
- Giannakopoulou D and Magee J Fluent model checking for event-based systems Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering, (257-266)
- Uchitel S, Kramer J and Magee J 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, (19-27)
- Redouane A Expressing Performance Issues in Web Application Design Proceedings of the 2nd IEEE International Conference on Cognitive Informatics
- Manolios P and Trefler R A lattice-theoretic characterization of safety and liveness Proceedings of the twenty-second annual symposium on Principles of distributed computing, (325-333)
- Fu Y (2003). Bisimulation congruence of ℵ-calculus, Information and Computation, 184:1, (201-226), Online publication date: 10-Jul-2003.
- Ingólfsdóttir A (2003). A semantic theory for value-passing processes based on the late approach, Information and Computation, 184:1, (1-44), Online publication date: 10-Jul-2003.
- Wang L and Chen K A typed theory for access control and information flow control in mobile systems Proceedings of the 8th Australasian conference on Information security and privacy, (154-165)
- Baumgartner J, Heyman T, Singhal V and Aziz A (2019). An Abstraction Algorithm for the Verification of Level-Sensitive Latch-Based Netlists, Formal Methods in System Design, 23:1, (39-65), Online publication date: 1-Jul-2003.
- Busi N, Gabbrielli M and Zavattaro G Replication vs. recursive definitions in channel based calculi Proceedings of the 30th international conference on Automata, languages and programming, (133-144)
- Chaki S, Clarke E, Groce A, Jha S and Veith H Modular verification of software components in C Proceedings of the 25th International Conference on Software Engineering, (385-395)
- Mateescu R A generic on-the-fly solver for alternation-free boolean equation systems Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems, (81-96)
- Tini S Rule formats for non interference Proceedings of the 12th European conference on Programming, (129-143)
- Jones C (2018). The Early Search for Tractable Ways of Reasoning about Programs, IEEE Annals of the History of Computing, 25:2, (26-49), Online publication date: 1-Apr-2003.
- Bartels F (2003). Generalised coinduction, Mathematical Structures in Computer Science, 13:2, (321-348), Online publication date: 1-Apr-2003.
- Sokolov D, Bystrov A and Yakovlev A STG Optimisation in the Direct Mapping of Asynchronous Circuits Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
- Bolognesi T and Börger E Abstract state processes Proceedings of the abstract state machines 10th international conference on Advances in theory and practice, (22-32)
- Pucella R (2019). Review of the π-calculus, ACM SIGACT News, 34:1, (17-24), Online publication date: 1-Mar-2003.
- Carreira P and Costa M (2003). Automatically verifying an object-oriented specification of the steam-boiler system, Science of Computer Programming, 46:3, (197-217), Online publication date: 1-Mar-2003.
- Uchitel S, Kramer J and Magee J (2003). Synthesis of Behavioral Models from Scenarios, IEEE Transactions on Software Engineering, 29:2, (99-115), Online publication date: 1-Feb-2003.
- Hamadi R and Benatallah B A Petri net-based model for web service composition Proceedings of the 14th Australasian database conference - Volume 17, (191-200)
- Schmidt D Programming language semantics Encyclopedia of Computer Science, (1463-1466)
- Martinelli F (2003). Analysis of security protocols as open systems, Theoretical Computer Science, 290:1, (1057-1106), Online publication date: 1-Jan-2003.
- Wang Y (2019). The Real-Time Process Algebra (RTPA), Annals of Software Engineering, 14:1-4, (235-274), Online publication date: 10-Dec-2002.
- Nielsen M, Palamidessi C and Valencia F On the expressive power of temporal concurrent constraint programming languages Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming, (156-167)
- Ostrovsky K, Prasad K and Taha W Towards a primitive higher order calculus of broadcasting systems Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming, (2-13)
- Bossi A, Focardi R, Piazza C and Rossi S A proof system for information flow security Proceedings of the 12th international conference on Logic based program synthesis and transformation, (199-218)
- Aziz A, Shiple T, Singhal V, Brayton R and Sangiovanni-Vincentelli A (2019). Formula-Dependent Equivalence for Compositional CTL Model Checking, Formal Methods in System Design, 21:2, (193-224), Online publication date: 1-Sep-2002.
- Bowman H, Steen M, Boiten E and Derrick J (2019). A Formal Framework for Viewpoint Consistency, Formal Methods in System Design, 21:2, (111-166), Online publication date: 1-Sep-2002.
- Focardi R and Rossi S Information Flow Security in Dynamic Contexts Proceedings of the 15th IEEE workshop on Computer Security Foundations
- (2002). Testing preorders for probabilistic processes can be characterized by simulations, Theoretical Computer Science, 282:1, (33-51), Online publication date: 7-Jun-2002.
- Bravetti M and Gorrieri R (2002). The theory of interactive generalized semi-Markov processes, Theoretical Computer Science, 282:1, (5-32), Online publication date: 7-Jun-2002.
- Cerone A From process algebra to visual language Proceedings of the conference on Application and theory of petri nets: formal methods in software engineering and defence systems - Volume 12, (27-36)
- Koppol P, Carver R and Tai K (2002). Incremental Integration Testing of Concurrent Programs, IEEE Transactions on Software Engineering, 28:6, (607-623), Online publication date: 1-Jun-2002.
- Hennessy M (2002). A fully abstract denotational semantics for the π-calculus, Theoretical Computer Science, 278:1-2, (53-89), Online publication date: 6-May-2002.
- Ying M (2019). Bisimulation indexes and their applications, Theoretical Computer Science, 275:1-2, (1-68), Online publication date: 28-Mar-2002.
- Busi N and Zavattaro G On the serializability of transactions in shared dataspaces with temporary data Proceedings of the 2002 ACM symposium on Applied computing, (359-366)
- Lee D and Yannakakis M (2002). Closed Partition Lattice and Machine Decomposition, IEEE Transactions on Computers, 51:2, (216-228), Online publication date: 1-Feb-2002.
- Merro M and Hennessy M Bisimulation congruences in safe ambients Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (71-80)
- Kuča A and Mayr R (2019). Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time, Theoretical Computer Science, 270:1-2, (677-700), Online publication date: 6-Jan-2002.
- Schmidt D Structure-preserving binary relations for program abstraction The essence of computation, (245-265)
- Merro M and Hennessy M (2002). Bisimulation congruences in safe ambients, ACM SIGPLAN Notices, 37:1, (71-80), Online publication date: 1-Jan-2002.
- Wang F and Hsiung P (2002). Efficient and User-Friendly Verification, IEEE Transactions on Computers, 51:1, (61-83), Online publication date: 1-Jan-2002.
- Nottegar C, Priami C and Degano P (2001). Performance Evaluation of Mobile Processes via Abstract Machines, IEEE Transactions on Software Engineering, 27:10, (867-889), Online publication date: 1-Oct-2001.
- Robles T, Huecas G, Quemada J, Verdejo A and Llana-Díaz L Process calculi Formal methods for distributed processing, (77-104)
- Bowman H and Derrick J Issues in formal methods Formal methods for distributed processing, (36-51)
- Lopes L, Vasconcelos V and Silva F (2001). Fine-Grained Multithreading with Process Calculi, IEEE Transactions on Computers, 50:8, (852-862), Online publication date: 1-Aug-2001.
- Uchitel S and Kramer J A workbench for synthesising behaviour models from scenarios Proceedings of the 23rd International Conference on Software Engineering, (188-197)
- Edwards S, Lavagno L, Lee E and Sangiovanni-Vincentelli A Design of embedded systems Readings in hardware/software co-design, (86-107)
- Lee E and Parks T Dataflow process networks Readings in hardware/software co-design, (59-85)
- Degano P and Priami C (2001). Enhanced operational semantics, ACM Computing Surveys (CSUR), 33:2, (135-176), Online publication date: 1-Jun-2001.
- Stirewalt R and Dillon L Generation of visitor components that implement program transformations Proceedings of the 2001 symposium on Software reusability: putting software reuse in context, (86-94)
- Garavel H, Mateescu R and Smarandache I Parallel state space construction for model-checking Proceedings of the 8th international SPIN workshop on Model checking of software, (217-234)
- Schacht S Formal reasoning about actor programs using temporal logic Concurrent object-oriented programming and petri nets, (445-460)
- Stirewalt R and Dillon L (2019). Generation of visitor components that implement program transformations, ACM SIGSOFT Software Engineering Notes, 26:3, (86-94), Online publication date: 1-May-2001.
- Jantsch A, Sander I and Wu W The usage of stochastic processes in embedded system specifications Proceedings of the ninth international symposium on Hardware/software codesign, (5-10)
- Abadi M and Fournet C (2001). Mobile values, new names, and secure communication, ACM SIGPLAN Notices, 36:3, (104-115), Online publication date: 1-Mar-2001.
- Cuesta C, de la Fuente P and Barrio-Solárzano M Dynamic coordination architecture through the use of reflection Proceedings of the 2001 ACM symposium on Applied computing, (134-140)
- Brinksma E and Tretmans J Testing transition systems Modeling and verification of parallel processes, (187-195)
- Valmari A Composition and abstraction Modeling and verification of parallel processes, (58-98)
- Abadi M and Fournet C Mobile values, new names, and secure communication Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (104-115)
- Barbuti R, De Francesco N, Santone A and Vaglini G (2019). Logic Based Abstractions of Real-Time Systems, Formal Methods in System Design, 17:3, (201-220), Online publication date: 1-Dec-2000.
- Chechik M and Wang H Bisimulation analysis of SDL-expressed protocols Proceedings of the 2000 conference of the Centre for Advanced Studies on Collaborative research
- Bernardo M, Ciancarini P and Donatiello L On the formalization of architectural types with process algebras Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications, (140-148)
- Godefroid P, Jagadeesan L, Jagadeesan R and Läufer K Automated systematic testing for constraint-based interactive services Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications, (40-49)
- Bernardo M, Ciancarini P and Donatiello L (2019). On the formalization of architectural types with process algebras, ACM SIGSOFT Software Engineering Notes, 25:6, (140-148), Online publication date: 1-Nov-2000.
- Godefroid P, Jagadeesan L, Jagadeesan R and Läufer K (2019). Automated systematic testing for constraint-based interactive services, ACM SIGSOFT Software Engineering Notes, 25:6, (40-49), Online publication date: 1-Nov-2000.
- Newman R Team accessible methods for production of safety critical hypermedia documentation Proceedings of IEEE professional communication society international professional communication conference and Proceedings of the 18th annual ACM international conference on Computer documentation: technology & teamwork, (239-251)
- Bakewell A and Runciman C A model for comparing the space usage of lazy evaluators Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming, (151-162)
- Thomas N, Munro M, King P and Pooley R Visual representation of stochastic process algebra models Proceedings of the 2nd international workshop on Software and performance, (18-19)
- Bernardo M, Ciancarini P and Donatiello L ÆMPA Proceedings of the 2nd international workshop on Software and performance, (1-11)
- Joshi R and Misra J Toward a theory of maximally concurrent programs (shortened version) Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, (319-328)
- Lamsweerde A Formal specification Proceedings of the Conference on The Future of Software Engineering, (147-159)
- Kang I, Lee I and Kim Y (2000). An Efficient State Space Generation for the Analysis of Real-Time Systems, IEEE Transactions on Software Engineering, 26:5, (453-477), Online publication date: 1-May-2000.
- Schmidt D (2000). Induction, Domains, Calculi, Higher-Order and Symbolic Computation, 13:1-2, (89-101), Online publication date: 1-Apr-2000.
- Pires P, Benevides M and Mattoso M Mechanisms for specifying communication behavior in object oriented database systems Proceedings of the 2000 ACM symposium on Applied computing - Volume 1, (389-397)
- Tremblay G Formal Methods Proceedings of the 13th Conference on Software Engineering Education & Training
- Brzozowski J and Zhang H (2000). Delay-Insensitivity and Semi-Modularity, Formal Methods in System Design, 16:2, (191-218), Online publication date: 1-Mar-2000.
- Suciu D Semistructured data and XML Information organization and databases, (9-30)
- Pitt D and Shields M (1999). Overtaking in Asynchronous Periodic Systems, Formal Aspects of Computing, 11:5, (567-590), Online publication date: 1-Dec-1999.
- Shields M (2019). An Acceptance Vector Semantics for Path Programs, Fundamenta Informaticae, 40:2,3, (285-316), Online publication date: 1-Aug-1999.
- Alur R and Henzinger T (1999). Reactive Modules, Formal Methods in System Design, 15:1, (7-48), Online publication date: 1-Jul-1999.
- Ryan P and Schneider S Process Algebra and Non-interference Proceedings of the 12th IEEE workshop on Computer Security Foundations
- Durante A, Focardi R and Gorrieri R CVS Proceedings of the 12th IEEE workshop on Computer Security Foundations
- Magee J Behavioral analysis of software architectures using LTSA Proceedings of the 21st international conference on Software engineering, (634-637)
- Bonner A Workflow, transactions and datalog Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (294-305)
- Nielsen M and Hune T (1999). Bisimulation and Open Maps for Timed Transition Systems, Fundamenta Informaticae, 38:1,2, (61-77), Online publication date: 1-Apr-1999.
- Bjørner D and Cuéllar J (2018). Software engineering education, Annals of Software Engineering, 6:1-4, (365-409), Online publication date: 1-Apr-1999.
- Koutny M and Pappalardo G A model of behaviour abstraction for communicating processes Proceedings of the 16th annual conference on Theoretical aspects of computer science, (313-322)
- Go K and Shiratori N (1999). A Decomposition of a Formal Specification, IEEE Transactions on Software Engineering, 25:2, (258-273), Online publication date: 1-Mar-1999.
- Buchholz P (1999). Hierarchical Structuring of Superposed GSPNs, IEEE Transactions on Software Engineering, 25:2, (166-181), Online publication date: 1-Mar-1999.
- Leduc G, Bonaventure O, Léonard L, Koerner E and Pecheur C (1999). Model-Based Verification of a Security Protocol for Conditional Access to Services, Formal Methods in System Design, 14:2, (171-191), Online publication date: 1-Mar-1999.
- Steffen B and Margaria T METAFrame in Practice Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel), (390-415)
- Taylor C (2019). A theory of core fudgets, ACM SIGPLAN Notices, 34:1, (75-85), Online publication date: 1-Jan-1999.
- Lee W, Cha S and Kwon Y (1998). Integration and Analysis of Use Cases Using Modular Petri Nets in Requirements Engineering, IEEE Transactions on Software Engineering, 24:12, (1115-1130), Online publication date: 1-Dec-1998.
- Erdogmus H Representing architectural evolution Proceedings of the 1998 conference of the Centre for Advanced Studies on Collaborative research
- Ben-Abdallah H, Choi J, Clarke D, Kim Y, Lee I and Xie H (1998). A Process Algebraic Approach to the Schedulability Analysisof Real-Time Systems, Real-Time Systems, 15:3, (189-219), Online publication date: 1-Nov-1998.
- Rossie J (2019). Logical observable entities, ACM SIGPLAN Notices, 33:10, (154-165), Online publication date: 1-Oct-1998.
- Rossie J Logical observable entities Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (154-165)
- Taylor C A theory of core fudgets Proceedings of the third ACM SIGPLAN international conference on Functional programming, (75-85)
- Middelburg K (2019). Truth of Duration Calculus Formulae in Timed Frames, Fundamenta Informaticae, 36:2,3, (235-263), Online publication date: 1-Aug-1998.
- Cortadella J, Kishinevsky M, Lavagno L and Yakovlev A (1998). Deriving Petri Nets from Finite Transition Systems, IEEE Transactions on Computers, 47:8, (859-882), Online publication date: 1-Aug-1998.
- Rajasekaran S and Lee I (1998). Parallel Algorithms for Relational Coarsest Partition Problems, IEEE Transactions on Parallel and Distributed Systems, 9:7, (687-699), Online publication date: 1-Jul-1998.
- Davulcu H, Kifer M, Ramakrishnan C and Ramakrishnan I Logic based modeling and analysis of workflows Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (25-33)
- de Nicola R, Ferrari G and Pugliese R (1998). KLAIM, IEEE Transactions on Software Engineering, 24:5, (315-330), Online publication date: 1-May-1998.
- Schmidt D (2019). Trace-Based Abstract Interpretation of Operational Semantics, Lisp and Symbolic Computation, 10:3, (237-271), Online publication date: 1-May-1998.
- Chen L Verification of an audio control protocol within real time process algebra Proceedings of the second workshop on Formal methods in software practice, (70-77)
- Katoen J, Langerak R, Brinksma E, Latella D and Bolognesi T (2019). A Consistent Causality-Based View on a Timed Process AlgebraIncluding Urgent Interactions, Formal Methods in System Design, 12:2, (189-216), Online publication date: 1-Mar-1998.
- Bernardeschi C, Fantechi A, Gnesi S, Larosa S, Mongardi G and Romano D (2019). A Formal Verification Environment for Railway Signaling System Design, Formal Methods in System Design, 12:2, (139-161), Online publication date: 1-Mar-1998.
- Schmidt D Data flow analysis is model checking of abstract interpretations Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (38-48)
- Attie P and Emerson E (1998). Synthesis of concurrent systems with many similar processes, ACM Transactions on Programming Languages and Systems (TOPLAS), 20:1, (51-115), Online publication date: 1-Jan-1998.
- Yakovlev A (2019). Designing Control Logic for Counterflow Pipeline Processor Using Petri Nets, Formal Methods in System Design, 12:1, (39-71), Online publication date: 1-Jan-1998.
- Negulescu R and Brzozowski J (2019). Relative Liveness, Formal Methods in System Design, 12:1, (73-115), Online publication date: 1-Jan-1998.
- Erdogmus H (2018). Architecture-driven verification of concurrent systems, Nordic Journal of Computing, 4:4, (380-413), Online publication date: 1-Dec-1997.
- Marinescu M and Goldberg B (1997). Partial-evaluation techniques for concurrent programs, ACM SIGPLAN Notices, 32:12, (47-62), Online publication date: 1-Dec-1997.
- Galloway A and Stoddart W An operational semantics for ZCCS Proceedings of the 1st International Conference on Formal Engineering Methods
- Dong J, Fulton N, Zucconi L and Colton J Formalising Process Scheduling Requirements for an Aircraft Operational Flight Program Proceedings of the 1st International Conference on Formal Engineering Methods
- Rosenblum D and Wolf A (2019). A design framework for Internet-scale event observation and notification, ACM SIGSOFT Software Engineering Notes, 22:6, (344-360), Online publication date: 1-Nov-1997.
- Cheung S, Giannakopoulou D and Kramer J (2019). Verification of liveness properties using compositional reachability analysis, ACM SIGSOFT Software Engineering Notes, 22:6, (227-243), Online publication date: 1-Nov-1997.
- Rosenblum D and Wolf A A design framework for Internet-scale event observation and notification Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering, (344-360)
- Cheung S, Giannakopoulou D and Kramer J Verification of liveness properties using compositional reachability analysis Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering, (227-243)
- Corsini M and Rauzy A (1997). Toupie, Journal of Automated Reasoning, 19:2, (143-171), Online publication date: 1-Oct-1997.
- Vercauteren S, Verkest D, de Jong G and Lin B Derivation of formal representations from process-based specification and implementation models Proceedings of the 10th international symposium on System synthesis, (16-23)
- Ungureanu C and Goldberg B (2019). Formal models of distributed memory management, ACM SIGPLAN Notices, 32:8, (280-291), Online publication date: 1-Aug-1997.
- Ungureanu C and Goldberg B Formal models of distributed memory management Proceedings of the second ACM SIGPLAN international conference on Functional programming, (280-291)
- Hascoët L (1997). Automatic placement of communications in mesh-partitioning parallelization, ACM SIGPLAN Notices, 32:7, (136-144), Online publication date: 1-Jul-1997.
- Hascoët L Automatic placement of communications in mesh-partitioning parallelization Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming, (136-144)
- Clarke D and Lee I Automatic generation of tests for timing constraints from requirements Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
- Lee E and Sangiovanni-Vincentelli A Comparing models of computation Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, (234-241)
- Kiehn A and Hennessy M (2019). On the Decidability of Non-Interleaving Process Equivalences, Fundamenta Informaticae, 30:1, (11-30), Online publication date: 1-Jan-1997.
- Thomsen B (1996). Programming languages, analysis tools, and concurrency theory, ACM Computing Surveys (CSUR), 28:4es, (57-es), Online publication date: 1-Dec-1996.
- Misra J (1996). A discipline of multiprogramming, ACM Computing Surveys (CSUR), 28:4es, (49-es), Online publication date: 1-Dec-1996.
- Hussak W and Keane J (1996). Expressing requirements on a parallel system formally, Requirements Engineering, 1:4, (199-209), Online publication date: 1-Dec-1996.
- Zave P and Jackson M (1996). Where Do Operations Come From? A Multiparadigm Specification Technique, IEEE Transactions on Software Engineering, 22:7, (508-528), Online publication date: 1-Jul-1996.
- Ferreira W, Hennessy M and Jeffrey A (2019). A theory of weak bisimulation for core CML, ACM SIGPLAN Notices, 31:6, (201-212), Online publication date: 15-Jun-1996.
- Turbak F (2019). First-class synchronization barriers, ACM SIGPLAN Notices, 31:6, (157-168), Online publication date: 15-Jun-1996.
- Ferreira W, Hennessy M and Jeffrey A A theory of weak bisimulation for core CML Proceedings of the first ACM SIGPLAN international conference on Functional programming, (201-212)
- Turbak F First-class synchronization barriers Proceedings of the first ACM SIGPLAN international conference on Functional programming, (157-168)
- Cheung S and Kramer J Checking subsystem safety properties in compositional reachability analysis Proceedings of the 18th international conference on Software engineering, (144-154)
- Avrilionis D, Cunin P and Fernström C OPSIS Proceedings of the 18th international conference on Software engineering, (38-47)
- Klarlund N, Nielsen M and Sunesen K Automated logical verification based on trace abstractions Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, (101-110)
- Barjaktarovic M, Chin S and Jabbour K Formal specification and verification of the kernel functional unit of the OSI session layer protocol and service using CCS Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis, (270-279)
- Koppol P and Tai K An incremental approach to structural testing of concurrent software Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis, (14-23)
- Barjaktarovic M, Chin S and Jabbour K (1996). Formal specification and verification of the kernel functional unit of the OSI session layer protocol and service using CCS, ACM SIGSOFT Software Engineering Notes, 21:3, (270-279), Online publication date: 1-May-1996.
- Koppol P and Tai K (1996). An incremental approach to structural testing of concurrent software, ACM SIGSOFT Software Engineering Notes, 21:3, (14-23), Online publication date: 1-May-1996.
- Focardi R Comparing Two Information Flow Security Properties Proceedings of the 9th IEEE workshop on Computer Security Foundations
- Gordon A and Rees G Bisimilarity for a first-order calculus of objects with subtyping Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (386-395)
- Fournet C and Gonthier G The reflexive CHAM and the join-calculus Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (372-385)
- Breuer P and Madrid N A native process algebra for VHDL Proceedings of the conference on European design automation, (420-426)
- Hyland J and Ong C Pi-calculus, dialogue games and full abstraction PCF Proceedings of the seventh international conference on Functional programming languages and computer architecture, (96-107)
- Fekete A (2019). Liveness conditions in model-based service specifications, ACM SIGSOFT Software Engineering Notes, 20:4, (62-71), Online publication date: 1-Oct-1995.
- Fekete A Liveness conditions in model-based service specifications Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering, (62-71)
- Celikkan U and Cleaveland R (2018). Generating diagnostic information for behavioral preorders, Distributed Computing, 9:2, (61-75), Online publication date: 1-Oct-1995.
- A Formal Approach to Model SNMP Network Management Systems Proceedings of the 4th International Conference on Computer Communications and Networks
- Valmari A and Tienari M (2018). Compositional failure-based semantic models for Basic LOTOS, Formal Aspects of Computing, 7:4, (440-468), Online publication date: 1-Jul-1995.
- Alur R, Courcoubetis C and Yannakakis M Distinguishing tests for nondeterministic and probabilistic machines Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (363-372)
- Clarke D and Lee I Testing real-time constraints in a process algebraic setting Proceedings of the 17th international conference on Software engineering, (51-60)
- Corno F, Cusinato M, Ferrero M and Prinetto P Proving testing preorders for process algebra descriptions Proceedings of the 1995 European conference on Design and Test
- Bloom B Structured operational semantics as a specification language Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (107-117)
- Bouajjani A, Echahed R and Habermehl P Verifying infinite state processes with sequential and parallel composition Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (95-106)
- Focardi R and Gorrieri R (2018). A Classification of Security Properties for Process Algebras, Journal of Computer Security, 3:1, (5-33), Online publication date: 1-Jan-1995.
- Merlo E, Gagné P, Girard J, Kontogiannis K, Hendren L, Panangaden P and De Mori R (1995). Reengineering User Interfaces, IEEE Software, 12:1, (64-73), Online publication date: 1-Jan-1995.
- Swamy G and Brayton R Incremental formal design verification Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design, (458-465)
- Bayol C, Soulas B, Borrione D, Corno F and Prinetto P A process algebra interpretation of a verification oriented overlanguage of VHDL Proceedings of the conference on European design automation, (506-511)
- Schettler O Design tool encapsulation—all problems solved? Proceedings of the conference on European design automation, (206-211)
- Lenk S Extended timing diagrams as a specification language Proceedings of the conference on European design automation, (28-33)
- Bustard D and Winstanley A (2019). Making Changes to Formal Specifications, IEEE Transactions on Software Engineering, 20:8, (562-568), Online publication date: 1-Aug-1994.
- Akella V and Gopalakrishnan G (2019). Specification and Validation of Control-Intensive IC's in hopCP, IEEE Transactions on Software Engineering, 20:6, (405-423), Online publication date: 1-Jun-1994.
- Cheung S and Kramer J An integrated method for effective behaviour analysis of distributed systems Proceedings of the 16th international conference on Software engineering, (309-320)
- Kramer J Distributed software engineering Proceedings of the 16th international conference on Software engineering, (253-263)
- Li J, Suzuki I and Yamashita M (2019). A New Structural Induction Theorem for Rings of Temporal Petri Nets, IEEE Transactions on Software Engineering, 20:2, (115-126), Online publication date: 1-Feb-1994.
- Rice M and Seidman S (2019). A Formal Model for Module Interconnection Languages, IEEE Transactions on Software Engineering, 20:1, (88-101), Online publication date: 1-Jan-1994.
- Tai K and Koppol P An incremental approach to reachability analysis of distributed programs Proceedings of the 7th international workshop on Software specification and design, (141-150)
- Cheung S and Kramer J Enhancing compositional reachability analysis with context constraints Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering, (115-125)
- Cheung S and Kramer J (2019). Enhancing compositional reachability analysis with context constraints, ACM SIGSOFT Software Engineering Notes, 18:5, (115-125), Online publication date: 1-Dec-1993.
- Nierstrasz O (2019). Regular types for active objects, ACM SIGPLAN Notices, 28:10, (1-15), Online publication date: 1-Oct-1993.
- Nierstrasz O Regular types for active objects Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications, (1-15)
- Eun S, No E, Kim H, Yoon H and Maeng S Specification of multimedia composition and a visual programming environment Proceedings of the first ACM international conference on Multimedia, (167-173)
- Olszewski J CSP laboratory Proceedings of the twenty-fourth SIGCSE technical symposium on Computer science education, (91-95)
- Olszewski J (1993). CSP laboratory, ACM SIGCSE Bulletin, 25:1, (91-95), Online publication date: 1-Mar-1993.
- Milner R (1993). Elements of interaction, Communications of the ACM, 36:1, (78-89), Online publication date: 1-Jan-1993.
- Tiedemann W An approach to multi-paradigm controller synthesis from timing diagram specifications Proceedings of the conference on European design automation, (522-527)
- Shields M (2018). Multitraces, hypertraces and partial order semantics, Formal Aspects of Computing, 4:1, (649-672), Online publication date: 1-Nov-1992.
- Satoh I and Tokoro M (1992). A formalism for real-time concurrent object-oriented computing, ACM SIGPLAN Notices, 27:10, (315-326), Online publication date: 31-Oct-1992.
- Satoh I and Tokoro M A formalism for real-time concurrent object-oriented computing Conference proceedings on Object-oriented programming systems, languages, and applications, (315-326)
- Takashio K and Tokoro M DROL Conference proceedings on Object-oriented programming systems, languages, and applications, (276-294)
- Joung Y and Smolka S A comprehensive study of the complexity of multiparty interaction Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (142-153)
- Ince D (1992). Arrays and pointers considered harmful, ACM SIGPLAN Notices, 27:1, (99-104), Online publication date: 1-Jan-1992.
- Tolmach A and Appel A (2019). Debuggable concurrency extensions for standard ML, ACM SIGPLAN Notices, 26:12, (120-131), Online publication date: 1-Dec-1991.
- Tolmach A and Appel A Debuggable concurrency extensions for standard ML Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging, (120-131)
- De Nicola R, Inverardi P and Nesi M Equational reasoning about LOTOS specifications Proceedings of the 6th international workshop on Software specification and design, (148-155)
- Paliwoda K and Sanders J (2018). An incremental specification of the sliding-window protocol, Distributed Computing, 5:2, (83-94), Online publication date: 1-Sep-1991.
- Martinolle F, Geffroy J and Soulas B Testability analysis of hierarchical finite state machines Proceedings of the conference on European design automation, (294-301)
- Shapiro E Separating concurrent languages with categories of language embeddings Proceedings of the twenty-third annual ACM symposium on Theory of Computing, (198-208)
- Peters J and Hankley W Proving specifications of tasking systems using Ada/TL Proceedings of the conference on TRI-ADA '90, (4-13)
- Nierstrasz O and Papathomas M (2019). Viewing object as patterns of communicating agents, ACM SIGPLAN Notices, 25:10, (38-43), Online publication date: 1-Oct-1990.
- Toetenel H, van Katwijk J and Plat N (2019). Structured analysis—formal design, using stream and object oriented formal specifications, ACM SIGSOFT Software Engineering Notes, 15:4, (118-127), Online publication date: 1-Sep-1990.
- Nierstrasz O and Papathomas M Viewing object as patterns of communicating agents Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications, (38-43)
- Cherief F An algebraic model for the parallel interpretation of equationally defined functions (abstract) Proceedings of the international symposium on Symbolic and algebraic computation
- Toetenel H, van Katwijk J and Plat N Structured analysis—formal design, using stream and object oriented formal specifications Conference proceedings on Formal methods in software development, (118-127)
- Berry G and Boudol G The chemical abstract machine Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (81-94)
- Dybjer P and Sander H (2018). A functional programming approach to the specification and verification of concurrent systems, Formal Aspects of Computing, 1:1, (303-319), Online publication date: 1-Mar-1989.
- Walker D (1989). Automated analysis of mutual exclusion algorithms using CCS, Formal Aspects of Computing, 1:1, (273-292), Online publication date: 1-Mar-1989.
Index Terms
- Communication and concurrency
Recommendations
Semantics-based concurrency control: beyond commutativity
The concurrency of transactions executing on atomic data types can be enhanced through the use of semantic information about operations defined on these types. Hitherto, commutativity of operations has been exploited to provide enchanced concurrency ...
Extracting more concurrency from distributed transactions
OSDI'14: Proceedings of the 11th USENIX conference on Operating Systems Design and ImplementationDistributed storage systems run transactions across machines to ensure serializability. Traditional protocols for distributed transactions are based on two-phase locking (2PL) or optimistic concurrency control (OCC). 2PL serializes transactions as soon ...
Prettier concurrency: purely functional concurrent revisions
Haskell '11This article presents an extension to the work of Launchbury and Peyton-Jones on the ST monad. Using a novel model for concurrency, called concurrent revisions [3,5], we show how we can use concurrency together with imperative mutable variables, while ...
Cristian Calude
This book offers a mathematical theory of communicating systems. The theory is not confined to the basic concepts of communication and concurrency, but applies to the general study of machines, architectures, programming methods, and languages. The underlying mathematics—some algebra and logic—can be found before the final year of computer science curricula. Milner's aim is to give the reader practice in representing real systems in terms of mathematical models and skill in manipulating these models to understand the behavior of the systems. Each new concept is discussed informally before it is defined rigorously. The book is suitable for both practically inclined readers (who can concentrate on modeling real systems) and mathematically oriented readers (who can appreciate the mathematical details). As Professor Hoare points out in his foreword, the book is an example of the fruitful interplay of theory and practice in computer science.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.