Browse Books

Din C, Hähnle R, Henrio L, Johnsen E, Pun V and Tarifa S (2024). Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages, ACM Transactions on Programming Languages and Systems, 46:1, (1-58), Online publication date: 31-Mar-2024.

Fan W, Lu P, Pang K, Jin R and Yu W (2024). Linking Entities across Relations and Graphs, ACM Transactions on Database Systems, 49:1, (1-50), Online publication date: 31-Mar-2024.

Tang Y and Moor T (2024). Compositional non-blockingness verification of finite automata with prioritised events, Discrete Event Dynamic Systems, 34:1, (125-161), Online publication date: 1-Mar-2024.

van Glabbeek R (2023). Comparing the Expressiveness of the π-calculus and CCS, ACM Transactions on Computational Logic, 25:1, (1-58), Online publication date: 31-Jan-2024.

Karsten N and Nestmann U Store Locally, Prove Globally Theoretical Aspects of Computing – ICTAC 2023, (351-369)

Bettini L, Bourr K, Pugliese R and Tiezzi F (2023). Coordinating and programming multiple ROS-based robots with X-KLAIM, International Journal on Software Tools for Technology Transfer (STTT), 25:5-6, (747-764), Online publication date: 1-Dec-2023.

Aceto L, Cassar I, Francalanza A and Ingólfsdóttir A (2023). On first-order runtime enforcement of branching-time properties, Acta Informatica, 60:4, (385-451), Online publication date: 1-Dec-2023.

Qiao S, Zhu P and Pedrycz W (2023). Approximate bisimulations for fuzzy-transition systems, Fuzzy Sets and Systems, 472:C, Online publication date: 30-Nov-2023.

Liu Z, Teng J and Liu B Multi-dimensional Abstraction and Decomposition for Separation of Concerns Dependable Software Engineering. Theories, Tools, and Applications, (152-170)

Ameur-Boulifa R, Corradi Q, Henrio L and Madelaine E Refinements for Open Automata Software Engineering and Formal Methods, (11-29)

Liu Z, Teng J and Liu B Formal Aspects of Component Software Formal Aspects of Component Software, (168-193)

Canfora G, Mercaldo F and Santone A (2023). A Novel Classification Technique based on Formal Methods, ACM Transactions on Knowledge Discovery from Data, 17:8, (1-30), Online publication date: 30-Sep-2023.

Maximova M, Schneider S and Giese H (2023). Compositional Analysis of Probabilistic Timed Graph Transformation Systems, Formal Aspects of Computing, 35:3, (1-79), Online publication date: 30-Sep-2023.

Jiang P, Wang W, Liu X, Sun L and Dong B Event Association Analysis Using Graph Rules Artificial Neural Networks and Machine Learning – ICANN 2023, (352-363)

Bernardo M, Lanese I, Marin A, Mezzina C, Rossi S and Sacerdoti Coen C Causal Reversibility Implies Time Reversibility Quantitative Evaluation of Systems, (270-287)

Hess A, MÖdersheim S and Brucker A (2023). Stateful Protocol Composition in Isabelle/HOL, ACM Transactions on Privacy and Security, 26:3, (1-36), Online publication date: 30-Aug-2023.

Banihashemi B, De Giacomo G and Lespérance Y Abstraction of nondeterministic situation calculus action theories Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (3112-3122)

Wu H and Long H (2023). Probabilistic weak bisimulation and axiomatization for probabilistic models, Information Processing Letters, 182:C, Online publication date: 1-Aug-2023.

Kori M, Ascari F, Bonchi F, Bruni R, Gori R and Hasuo I Exploiting Adjoints in Property Directed Reachability Analysis Computer Aided Verification, (41-63)

Qiao S, Zhu P and Feng J (2023). Fuzzy Bisimulations for Nondeterministic Fuzzy Transition Systems, IEEE Transactions on Fuzzy Systems, 31:7, (2450-2463), Online publication date: 1-Jul-2023.

Esposito A, Aldini A and Bernardo M Branching Bisimulation Semantics Enables Noninterference Analysis of Reversible Systems Formal Techniques for Distributed Objects, Components, and Systems, (57-74)

van Glabbeek R, Gramoli V and Tholoniat P (2023). Cross-chain payment protocols with success guarantees, Distributed Computing, 36:2, (137-157), Online publication date: 1-Jun-2023.

Zhu X, Liu Y, Liu S and Fan W (2023). MiniGraph: Querying Big Graphs with a Single Machine, Proceedings of the VLDB Endowment, 16:9, (2172-2185), Online publication date: 1-May-2023.

Chan A, Sokolov D, Khomenko V, Lloyd D and Yakovlev A (2023). Burst Automaton: Framework for Speed-Independent Synthesis Using Burst-Mode Specifications, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 42:5, (1560-1573), Online publication date: 1-May-2023.

Chappe N, He P, Henrio L, Zakowski Y and Zdancewic S (2023). Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq, Proceedings of the ACM on Programming Languages, 7:POPL, (1770-1800), Online publication date: 9-Jan-2023.

Goncharov S, Milius S, Schröder L, Tsampas S and Urbat H (2023). Towards a Higher-Order Mathematical Operational Semantics, Proceedings of the ACM on Programming Languages, 7:POPL, (632-658), Online publication date: 9-Jan-2023.

Gutierrez J, Kowara S, Kraus S, Steeples T and Wooldridge M (2023). Cooperative concurrent games, Artificial Intelligence, 314:C, Online publication date: 1-Jan-2023.

Ren W and Dimarogonas D Dynamic Quantization based Symbolic Abstractions for Nonlinear Control Systems 2019 IEEE 58th Conference on Decision and Control (CDC), (4343-4348)

Yu P and Dimarogonas D Approximately symbolic models for a class of continuous-time nonlinear systems 2019 IEEE 58th Conference on Decision and Control (CDC), (4349-4354)

Rezaei-Shoshtari S, Zhao R, Panangaden P, Meger D and Precup D Continuous MDP homomorphisms and homomorphic policy gradient Proceedings of the 36th International Conference on Neural Information Processing Systems, (20189-20204)

Aceto L, Castiglioni V, Fokkink W, Ingólfsdóttir A and Luttik B (2022). Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?, ACM Transactions on Computational Logic, 23:4, (1-56), Online publication date: 31-Oct-2022.

Sun Q, Zhang W, Wang C and Liu Z A Contract-Based Semantics and Refinement for Simulink Dependable Software Engineering. Theories, Tools, and Applications, (134-148)

Mahfoud H Towards a Strong Containment for Efficient Matching of Expressive Graph Patterns Proceedings of the 14th International Conference on Management of Digital EcoSystems, (48-55)

Schinko A, Vogler W, Gareis J, Nguyen N and Lüttgen G (2022). Interface Automata for Shared Memory, Acta Informatica, 59:5, (521-556), Online publication date: 1-Oct-2022.

Voorneveld N Runners for Interleaving Algebraic Effects Theoretical Aspects of Computing – ICTAC 2022, (407-424)

Mahfoud H (2022). Expressive top-k matching for conditional graph patterns, Neural Computing and Applications, 34:17, (14205-14221), Online publication date: 1-Sep-2022.

Bagossy A and Vaszil G (2022). Controlled reversibility in communicating reaction systems, Theoretical Computer Science, 926:C, (3-20), Online publication date: 18-Aug-2022.

Fan W (2022). Big graphs, Proceedings of the VLDB Endowment, 15:12, (3782-3797), Online publication date: 1-Aug-2022.

Cai K, Giua A and Seatzu C (2022). Consistent reduction in discrete-event systems, Automatica (Journal of IFAC), 142:C, Online publication date: 1-Aug-2022.

Di Stefano L, De Nicola R and Inverso O (2022). Verification of Distributed Systems via Sequential Emulation, ACM Transactions on Software Engineering and Methodology, 31:3, (1-41), Online publication date: 31-Jul-2022.

König H and Wolter U Consistency of Heterogeneously Typed Behavioural Models: A Coalgebraic Approach Theoretical Aspects of Software Engineering, (308-325)

Freiberger F pseuCo Book Proceedings of the 27th ACM Conference on on Innovation and Technology in Computer Science Education Vol. 1, (414-420)

Komorida Y, Katsumata S, Hu N, Klin B, Humeau S, Eberhart C and Hasuo I (2022). Codensity Games for Bisimilarity, New Generation Computing, 40:2, (403-465), Online publication date: 1-Jul-2022.

Falcone Y, Salaün G and Zuo A Probabilistic Model Checking of BPMN Processes at Runtime Integrated Formal Methods, (191-208)

Kavanagh R (2022). Fairness and communication-based semantics for session-typed languages, Information and Computation, 285:PB, Online publication date: 1-May-2022.

Baldan P, Gorla D, Padoan T and Salvo I (2022). Characterising spectra of equivalences for event structures, logically, Information and Computation, 285:PB, Online publication date: 1-May-2022.

Aman B and Ciobanu G Synchronization operator for communication privacy Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing, (1284-1290)

Kulik T, Dongol B, Larsen P, Macedo H, Schneider S, Tran-Jørgensen P and Woodcock J (2022). A Survey of Practical Formal Methods for Security, Formal Aspects of Computing, 34:1, (1-39), Online publication date: 31-Mar-2022.

Zhang C and Pang J (2022). Modal characterisation of simulation relations in probabilistic concurrent games, Science of Computer Programming, 215:C, Online publication date: 1-Mar-2022.

Jančar P (2022). Bisimilarity on Basic Parallel Processes, Theoretical Computer Science, 903:C, (26-38), Online publication date: 8-Feb-2022.

Sangiorgi D (2022). From enhanced coinduction towards enhanced induction, Proceedings of the ACM on Programming Languages, 6:POPL, (1-29), Online publication date: 16-Jan-2022.

Prabhakar P Bisimulations for Neural Network Reduction Verification, Model Checking, and Abstract Interpretation, (285-300)

Fu Y (2022). A thesis for interaction, Theoretical Computer Science, 897:C, (114-134), Online publication date: 2-Jan-2022.

Gorrieri R (2022). A study on team bisimulation and H-team bisimulation for BPP nets, Theoretical Computer Science, 897:C, (83-113), Online publication date: 2-Jan-2022.

Yang Q and Fu Y (2022). Counting nondeterministic computations, Theoretical Computer Science, 897:C, (49-63), Online publication date: 2-Jan-2022.

Li J and Takai S (2022). Synthesis of maximally permissive supervisors for similarity control of partially observed nondeterministic discrete event systems, Automatica (Journal of IFAC), 135:C, Online publication date: 1-Jan-2022.

Ren W, Calbert J and Jungers R Zonotope-based Controller Synthesis for LTL Specifications 2021 60th IEEE Conference on Decision and Control (CDC), (580-585)

Tang Y and Moor T Compositional Verification of Finite Automata under Event Preemption 2021 60th IEEE Conference on Decision and Control (CDC), (301-308)

Ngondi G, Koutavas V and Butterfield A Translation of CCS into CSP, Correct up to Strong Bisimulation Software Engineering and Formal Methods, (243-261)

Francalanza A (2022). A theory of monitors, Information and Computation, 281:C, Online publication date: 1-Dec-2021.

Ju W A new process algebra more suitable for formal specification Proceedings of the 4th International Conference on Computer Science and Software Engineering, (103-106)

Lanotte R, Merro M and Munteanu A (2021). A process calculus approach to detection and mitigation of PLC malware, Theoretical Computer Science, 890:C, (125-146), Online publication date: 12-Oct-2021.

Brookes S and Roscoe A CSP: A Practical Process Algebra Theories of Programming, (187-222)

Jones C and Misra J Finding Effective Abstractions Theories of Programming, (23-40)

Lang F, Mateescu R and Mazzanti F (2021). Compositional verification of concurrent systems by combining bisimulations, Formal Methods in System Design, 58:1-2, (83-125), Online publication date: 1-Oct-2021.

Gorrieri R (2021). Team bisimilarity, and its associated modal logic, for BPP nets, Acta Informatica, 58:5, (529-569), Online publication date: 1-Oct-2021.

Guo X, Han S, Hu X, Jiao X, Jin Y, Kong F and Lemmon M Towards scalable, secure, and smart mission-critical IoT systems Proceedings of the 2021 International Conference on Embedded Software, (1-10)

Marin A, Piazza C and Rossi S (2021). D_PSNI, Theoretical Computer Science, 884:C, (116-135), Online publication date: 7-Sep-2021.

Goncharov S, Rauch C and Schröder L (2021). A metalanguage for guarded iteration, Theoretical Computer Science, 880:C, (111-137), Online publication date: 3-Aug-2021.

Butkova Y, Hartmanns A and Hermanns H (2021). A Modest Approach to Markov Automata, ACM Transactions on Modeling and Computer Simulation, 31:3, (1-34), Online publication date: 31-Jul-2021.

Lee E (2021). Determinism, ACM Transactions on Embedded Computing Systems, 20:5, (1-34), Online publication date: 1-Jul-2021.

Spring J and Illari P (2021). Review of Human Decision-making during Computer Security Incident Analysis, Digital Threats: Research and Practice, 2:2, (1-47), Online publication date: 30-Jun-2021.

Komorida Y, Katsumata S, Kupke C, Rot J and Hasuo I Expressivity of quantitative modal logics categorical foundations via codensity and approximation Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-14)

Bacci G, Bacci G, Larsen K, Tribastone M, Tschaikowski M and Vandin A Efficient local computation of differential bisimulations via coupling and up-to methods Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-14)

Aceto L, Anastasiadi E, Castiglioni V, Ingólfsdóttir A and Luttik B In search of lost time Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-14)

Ford C, Milius S and Schröder L Behavioural preorders via graded monads Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)

Wang D, Hoffmann J and Reps T Sound probabilistic inference via guide types Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, (788-803)

Istrate G Models We Can Trust: Toward a Systematic Discipline of (Agent-Based) Model Interpretation and Validation Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, (6-11)

Bravetti M and Zavattaro G (2021). Asynchronous session subtyping as communicating automata refinement, Software and Systems Modeling (SoSyM), 20:2, (311-333), Online publication date: 1-Apr-2021.

Cai S, Gallina B, Nyström D and Seceleanu C (2021). Specification and automated verification of atomic concurrent real-time transactions, Software and Systems Modeling (SoSyM), 20:2, (557-589), Online publication date: 1-Apr-2021.

Pola G, Manes C and Di Benedetto M On external behavior equivalence of continuous-time stochastic linear control systems 2016 IEEE 55th Conference on Decision and Control (CDC), (6583-6588)

Mizoguchi M and Ushio T Symbolic control of systems with dead times using symbolic smith predictors 2016 IEEE 55th Conference on Decision and Control (CDC), (5726-5731)

Prabhakar P and Liu J Bisimulations for input-output stability of hybrid systems 2016 IEEE 55th Conference on Decision and Control (CDC), (5515-5520)

Hill R and Lafortune S Planning under abstraction within a supervisory control context 2016 IEEE 55th Conference on Decision and Control (CDC), (4770-4777)

Popescu A, Lammich P and Hou P (2021). CoCon: A Conference Management System with Formally Verified Document Confidentiality, Journal of Automated Reasoning, 65:2, (321-356), Online publication date: 1-Feb-2021.

Gleirscher M, Foster S and Woodcock J (2019). New Opportunities for Integrated Formal Methods, ACM Computing Surveys, 52:6, (1-36), Online publication date: 30-Nov-2020.

Canetti R (2020). Universally Composable Security, Journal of the ACM, 67:5, (1-94), Online publication date: 31-Oct-2020.

Baier C, Dubslaff C, Hermanns H, Klauck M, Klüppelholz S and Köhl M Components in Probabilistic Systems: Suitable by Construction Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles, (240-261)

Kulik T, Boudjadar J and Tran-Jørgensen P Security Verification of Industrial Control Systems using Partial Model Checking Proceedings of the 8th International Conference on Formal Methods in Software Engineering, (98-108)

Kulik T, Boudjadar J and Aranha D Towards Formally Verified Key Management for Industrial Control Systems Proceedings of the 8th International Conference on Formal Methods in Software Engineering, (119-129)

Baier C, D’Argenio P and Hermanns H (2020). On the probabilistic bisimulation spectrum with silent moves, Acta Informatica, 57:3-5, (465-512), Online publication date: 1-Oct-2020.

Jasper M, Schlüter M and Steffen B (2020). Characteristic invariants in Hennessy–Milner logic, Acta Informatica, 57:3-5, (671-687), Online publication date: 1-Oct-2020.

Vogler W and Lüttgen G (2020). A linear-time branching-time perspective on interface automata, Acta Informatica, 57:3-5, (513-550), Online publication date: 1-Oct-2020.

Valmari A (2020). All congruences below stability-preserving fair testing or CFFD, Acta Informatica, 57:3-5, (353-383), Online publication date: 1-Oct-2020.

Bisping B, Nestmann U and Peters K (2019). Coupled similarity: the first 32 years, Acta Informatica, 57:3-5, (439-463), Online publication date: 1-Oct-2020.

Becchi A, Cimatti A and Zaffanella E Synthesis of P-Stable Abstractions Software Engineering and Formal Methods, (214-230)

Ozeer U, Salaün G, Letondeur L, Ottogalli F and Vincent J Verification of a Failure Management Protocol for Stateful IoT Applications Formal Methods for Industrial Critical Systems, (272-287)

Mahfoud H (2019). Graph pattern matching with counting quantifiers and label-repetition constraints, Cluster Computing, 23:3, (1529-1553), Online publication date: 1-Sep-2020.

Zhou T, Wang J and Miao Y A Formal Method for Safety Time Series Simulation of Aerospace Artificial Intelligence and Security, (38-48)

Anureev I, Garanina N, Lyakh T, Rozov A, Zyubin V and Gorlatch S (2020). Dedicative Verification of Reflex Programs, Programming and Computing Software, 46:4, (261-272), Online publication date: 1-Jul-2020.

Gorrieri R A Study on Team Bisimulations for BPP Nets Application and Theory of Petri Nets and Concurrency, (153-175)

Gorrieri R Interleaving vs True Concurrency: Some Instructive Security Examples Application and Theory of Petri Nets and Concurrency, (131-152)

Bernardo M and Mezzina C Towards Bridging Time and Causal Reversibility Formal Techniques for Distributed Objects, Components, and Systems, (22-38)

Beillahi S, Ciocarlie G, Emmi M and Enea C Behavioral simulation for smart contracts Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, (470-486)

Cavalcanti A, Hierons R and Nogueira S (2020). Inputs and Outputs in CSP, ACM Transactions on Computational Logic, 21:3, (1-53), Online publication date: 22-May-2020.

Jančar P (2020). Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence, Journal of Computer and System Sciences, 109:C, (22-44), Online publication date: 1-May-2020.

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)

Cimino M, De Francesco N, Mercaldo F, Santone A and Vaglini G (2020). Model checking for malicious family detection and phylogenetic analysis in mobile environment, Computers and Security, 90:C, Online publication date: 1-Mar-2020.

Truong T and Le T Modeling and Simulating Concurrent Communications of Distributed Sensing Networks Proceedings of the 2020 9th International Conference on Software and Computer Applications, (253-257)

Zhang Q, Feng J, Wang B and Meng M (2019). Bisimulations of boolean control networks with impulsive effects and its application in controllability, Asian Journal of Control, 21:6, (2559-2568), Online publication date: 23-Jan-2020.

Heath Q and Miller D (2019). A Proof Theory for Model Checking, Journal of Automated Reasoning, 63:4, (857-885), Online publication date: 1-Dec-2019.

Apt K and Olderog E (2019). Fifty years of Hoare’s logic, Formal Aspects of Computing, 31:6, (751-807), Online publication date: 1-Dec-2019.

Pous D and Sangiorgi D (2019). Bisimulation and Coinduction Enhancements: A Historical Perspective, Formal Aspects of Computing, 31:6, (733-749), Online publication date: 1-Dec-2019.

Biernacki D, Lenglet S and Polesiuk P (2019). Diacritical Companions, Electronic Notes in Theoretical Computer Science (ENTCS), 347:C, (25-43), Online publication date: 30-Nov-2019.

van den Bos P and Vaandrager F State Identification for Labeled Transition Systems with Inputs and Outputs Formal Aspects of Component Software, (191-212)

Barbierato E, Gribaudo M and Iacono M Map-Reduce Process Algebra: A Formalism to Describe Directed Acyclic Graph Task-Based Jobs in Parallel Environments Analytical and Stochastic Modelling Techniques and Applications, (85-99)

Hayes I and Meinicke L Developing an Algebra for Rely/Guarantee Concurrency: Design Decisions and Challenges Unifying Theories of Programming, (176-197)

Smith G and Duke D Specification with Class: A Brief History of Object-Z Formal Methods. FM 2019 International Workshops, (73-86)

Jones C Reasoning About Shared-Variable Concurrency: Interactions Between Research Threads Formal Methods. FM 2019 International Workshops, (54-72)

Hennicker R, Knapp A, Madeira A and Mindt F Behavioural and Abstractor Specifications for a Dynamic Logic with Binders and Silent Transitions Dynamic Logic. New Trends and Applications, (19-34)

Jongmans S, Lamers A and van Eekelen M SOA and the Button Problem Formal Methods – The Next 30 Years, (689-706)

Lang F, Mateescu R and Mazzanti F Compositional Verification of Concurrent Systems by Combining Bisimulations Formal Methods – The Next 30 Years, (196-213)

Miller D (2019). Mechanized Metatheory Revisited, Journal of Automated Reasoning, 63:3, (625-665), Online publication date: 1-Oct-2019.

Miyazawa A, Ribeiro P, Li W, Cavalcanti A, Timmis J and Woodcock J (2019). RoboChart, Software and Systems Modeling (SoSyM), 18:5, (3097-3149), Online publication date: 1-Oct-2019.

Bravetti M and Zavattaro G Relating Session Types and Behavioural Contracts: The Asynchronous Case Software Engineering and Formal Methods, (29-47)

Salaün G Quantifying the Similarity of Non-bisimilar Labelled Transition Systems Software Engineering and Formal Methods, (211-225)

Atampore F, Dingel J and Rudie K (2019). A controller synthesis framework for automated service composition, Discrete Event Dynamic Systems, 29:3, (297-365), Online publication date: 1-Sep-2019.

Cai K, Giua A and Seatzu C On Consistent Reduction in Discrete-Event Systems 2019 IEEE 15th International Conference on Automation Science and Engineering (CASE), (474-479)

Antonino P, Gibson-Robinson T and Roscoe A (2019). Efficient Verification of Concurrent Systems Using Synchronisation Analysis and SAT/SMT Solving, ACM Transactions on Software Engineering and Methodology, 28:3, (1-43), Online publication date: 17-Aug-2019.

Folhadela Benevides M and Macalam Saab Lima I (2019). Dynamic Epistemic Logic with Communication Actions, Electronic Notes in Theoretical Computer Science (ENTCS), 344:C, (67-82), Online publication date: 16-Aug-2019.

Jiang Y, Liu S and Ehrhard T (2019). A fully abstract semantics for value-passing CCS for trees, Frontiers of Computer Science: Selected Publications from Chinese Universities, 13:4, (828-849), Online publication date: 1-Aug-2019.

Aceto L, Della Monica D, Fábregas I and Ingólfsdóttir A (2022). When are prime formulae characteristic?, Theoretical Computer Science, 777:C, (3-31), Online publication date: 19-Jul-2019.

Anureev I, Garanina N, Liakh T, Rozov A, Zyubin V and Gorlatch S Two-Step Deductive Verification of Control Software Using Reflex Perspectives of System Informatics, (50-63)

Cenciarelli P, Gorla D and Salvo I (2019). Depletable channels, Acta Informatica, 56:5, (405-431), Online publication date: 1-Jul-2019.

Komorida Y, Katsumata S, Hu N, Klin B and Hasuo I Codensity games for bisimilarity Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)

Bonchi F, Sokolova A and Vignudelli V The theory of traces for systems with nondeterminism and probability Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-14)

Montali M and Rivkin A From DB-nets to Coloured Petri Nets with Priorities Application and Theory of Petri Nets and Concurrency, (449-469)

Schneider V and Vogler W Modal Open Petri Nets Application and Theory of Petri Nets and Concurrency, (25-46)

Janicki R On Interval Semantics of Inhibitor and Activator Nets Application and Theory of Petri Nets and Concurrency, (192-212)

Gruska D and Ruiz M Security of Low Level IoT Protocols Computational Science – ICCS 2019, (621-633)

Scalas A, Yoshida N and Benussi E Verifying message-passing programs with dependent behavioural types Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, (502-516)

Fendrich S and Lüttgen G (2019). A generalised theory of Interface Automata, component compatibility and error, Acta Informatica, 56:4, (287-319), Online publication date: 1-Jun-2019.

Sabahi-Kaviani Z and Ghassemi F (2019). Behavioral model identification and classification of multi-component systems, Science of Computer Programming, 177:C, (41-66), Online publication date: 15-May-2019.

Boode A and Broersma H (2019). Decompositions of graphs based on a new graph product, Discrete Applied Mathematics, 259:C, (31-40), Online publication date: 30-Apr-2019.

Johnson R, Dong Q and Winfree E (2019). Verifying chemical reaction network implementations, Theoretical Computer Science, 765:C, (3-46), Online publication date: 18-Apr-2019.

Shin S, Thachuk C and Winfree E (2019). Verifying chemical reaction network implementations, Theoretical Computer Science, 765:C, (67-96), Online publication date: 18-Apr-2019.

Bernardo M and Miculan M (2019). Constructive logical characterizations of bisimilarity for reactive probabilistic systems, Theoretical Computer Science, 764:C, (80-99), Online publication date: 11-Apr-2019.

Bisping B and Nestmann U Computing Coupled Similarity Tools and Algorithms for the Construction and Analysis of Systems, (244-261)

UL Muram F, Tran H and Zdun U (2019). Supporting automated containment checking of software behavioural models using model transformations and model checking, Science of Computer Programming, 174:C, (38-71), Online publication date: 1-Apr-2019.

Bergstra J and Middelburg C (2019). Process Algebra with Strategic Interleaving, Theory of Computing Systems, 63:3, (488-505), Online publication date: 1-Apr-2019.

Hayes I, Meinicke L, Winter K and Colvin R (2019). A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency, Formal Aspects of Computing, 31:2, (133-163), Online publication date: 1-Apr-2019.

Mavridou A, Laszka A, Stachtiari E and Dubey A VeriSolid: Correct-by-Design Smart Contracts for Ethereum Financial Cryptography and Data Security, (446-465)

Dong X, Fu Y and Varacca D (2019). Extensional Petri net, Formal Aspects of Computing, 31:1, (47-58), Online publication date: 12-Feb-2019.

Gabmeyer S, Kaufmann P, Seidl M, Gogolla M and Kappel G (2019). A feature-based classification of formal verification techniques for software models, Software and Systems Modeling (SoSyM), 18:1, (473-498), Online publication date: 1-Feb-2019.

Truong T, Pottier B and Huynh H A Developing Method for Distributed Sensing Systems Proceedings of the 3rd International Conference on Machine Learning and Soft Computing, (210-214)

Huang B, Zhang H, Subramanyan P, Vizel Y, Gupta A and Malik S (2018). Instruction-Level Abstraction (ILA), ACM Transactions on Design Automation of Electronic Systems, 24:1, (1-24), Online publication date: 11-Jan-2019.

Aceto L, Achilleos A, Francalanza A, Ingólfsdóttir A and Lehtinen K (2019). Adventures in monitorability: from branching to linear time and back again, Proceedings of the ACM on Programming Languages, 3:POPL, (1-29), Online publication date: 2-Jan-2019.

Kokke W, Montesi F and Peressotti M (2019). Better late than never: a fully-abstract semantics for classical processes, Proceedings of the ACM on Programming Languages, 3:POPL, (1-29), Online publication date: 2-Jan-2019.

Blanchette J, Gheri L, Popescu A and Traytel D (2019). Bindings as bounded natural functors, Proceedings of the ACM on Programming Languages, 3:POPL, (1-34), Online publication date: 2-Jan-2019.

Brunese L, Mercaldo F, Reginelli A and Santone A (2020). Formal Modeling for Magnetic Resonance Images Tamper Mitigation, Procedia Computer Science, 159:C, (1803-1810), Online publication date: 1-Jan-2019.

Brunese L, Mercaldo F, Reginelli A and Santone A (2020). Radiomic Features for Medical Images Tamper Detection by Equivalence Checking, Procedia Computer Science, 159:C, (1795-1802), Online publication date: 1-Jan-2019.

Brunese L, Mercaldo F, Reginelli A and Santone A (2020). A Blockchain Based Proposal for Protecting Healthcare Systems through Formal Methods, Procedia Computer Science, 159:C, (1787-1794), Online publication date: 1-Jan-2019.

Ardeshir-Larijani E, Gay S and Nagarajan R (2018). Automated Equivalence Checking of Concurrent Quantum Systems, ACM Transactions on Computational Logic, 19:4, (1-32), Online publication date: 8-Dec-2018.

Jones N On Modeling and Programming Leveraging Applications of Formal Methods, Verification and Validation. Modeling, (22-34)

Cimitile A, Mercaldo F, Nardone V, Santone A and Visaggio C (2018). Talos, International Journal of Information Security, 17:6, (719-738), Online publication date: 1-Nov-2018.

Evans C and Winfree E Optimizing Tile Set Size While Preserving Proofreading with a DNA Self-assembly Compiler DNA Computing and Molecular Programming, (37-54)

Lin K, Shen C and Chao W Enriching UML from Model Multiplicity to Model Singularity with Structure-Behavior Coalescence 2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC), (1970-1975)

Valmari A and Vogler W (2018). Fair testing and stubborn sets, International Journal on Software Tools for Technology Transfer (STTT), 20:5, (589-610), Online publication date: 1-Oct-2018.

Boer F, Serbanescu V, Hähnle R, Henrio L, Rochas J, Din C, Johnsen E, Sirjani M, Khamespanah E, Fernandez-Reyes K and Yang A (2017). A Survey of Active Object Languages, ACM Computing Surveys, 50:5, (1-39), Online publication date: 30-Sep-2018.

Ramakrishnan C State-space search with tabled logic programs Declarative Logic Programming, (427-472)

Jing Y, Wang H, Huang Y, Zhang L and Cao Y (2018). A Modeling Language for MapReduce Programing in a Storage System Perspective, Journal of Signal Processing Systems, 90:8-9, (1133-1150), Online publication date: 1-Sep-2018.

Chane-Yack-Fa R, Frappier M, Mammar A and Finkel A (2018). Parameterized verification of monotone information systems, Formal Aspects of Computing, 30:3-4, (463-489), Online publication date: 1-Aug-2018.

Shi L, Zhao Y, Liu Y, Sun J, Dong J and Qin S (2018). A UTP semantics for communicating processes with shared variables and its formal encoding in PVS, Formal Aspects of Computing, 30:3-4, (351-380), Online publication date: 1-Aug-2018.

Yang Y, Tsai C and Chao W A Structure-Behavior Coalescence Systems Modeling Approach for Service Systems Design HCI in Business, Government, and Organizations, (236-249)

Banihashemi B, De Giacomo G and Lespérance Y Abstraction of agents executing online and their abilities in the situation calculus Proceedings of the 27th International Joint Conference on Artificial Intelligence, (1699-1706)

Banihashemi B, De Giacomo G and Lesperance Y Hierarchical Agent Supervision Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, (1432-1440)

Bonchi F, Ganty P, Giacobazzi R and Pavlovic D Sound up-to techniques and Complete abstract domains Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, (175-184)

Bravetti M and Zavattaro G Foundations of Coordination and Contracts and Their Contribution to Session Type Theory Coordination Models and Languages, (21-50)

Lochbihler A (2018). Mechanising a Type-Safe Model of Multithreaded Java with a Verified Compiler, Journal of Automated Reasoning, 61:1-4, (243-332), Online publication date: 1-Jun-2018.

Akroun L and Salaün G (2018). Automated verification of automata communicating via FIFO and bag buffers, Formal Methods in System Design, 52:3, (260-276), Online publication date: 1-Jun-2018.

Borda A, Pasquale L, Koutavas V and Nuseibeh B Compositional verification of self-adaptive cyber-physical systems Proceedings of the 13th International Conference on Software Engineering for Adaptive and Self-Managing Systems, (1-11)

Lange J, Ng N, Toninho B and Yoshida N A static verification framework for message passing in Go using behavioural types Proceedings of the 40th International Conference on Software Engineering, (1137-1148)

Chebieb A and Ait Ameur Y (2018). A formal model for plastic human computer interfaces, Frontiers of Computer Science: Selected Publications from Chinese Universities, 12:2, (351-375), Online publication date: 1-Apr-2018.

Du R, Yang J, Cao Y and Wang H (2018). Personalized graph pattern matching via limited simulation, Knowledge-Based Systems, 141:C, (31-43), Online publication date: 1-Feb-2018.

Carver R and Lei Y (2018). Stateless techniques for generating global and local test oracles for message-passing concurrent programs, Journal of Systems and Software, 136:C, (237-265), Online publication date: 1-Feb-2018.

Danielsson N (2017). Up-to techniques using sized types, Proceedings of the ACM on Programming Languages, 2:POPL, (1-28), Online publication date: 1-Jan-2018.

Pola G On achievable behavior of stochastic descriptor systems 2017 IEEE 56th Annual Conference on Decision and Control (CDC), (3164-3169)

Fokkink W and van Glabbeek R (2017). Divide and congruence II, Information and Computation, 257:C, (79-113), Online publication date: 1-Dec-2017.

Deng Y and Feng Y (2017). Probabilistic bisimilarity as testing equivalence, Information and Computation, 257:C, (58-64), Online publication date: 1-Dec-2017.

Bodeveix J, Filali-Amine M and Kan S A refinement-based compiler development for synchronous languages Proceedings of the 15th ACM-IEEE International Conference on Formal Methods and Models for System Design, (165-174)

Gheri L and Popescu A A Formalized General Theory of Syntax with Bindings Interactive Theorem Proving, (241-261)

Cesari L, Pugliese R and Tiezzi F (2017). Blind-date conversation joining, Service Oriented Computing and Applications, 11:3, (265-283), Online publication date: 1-Sep-2017.

Martinelli F, Mercaldo F, Nardone V and Santone A Malware and Formal Methods Proceedings of the 12th International Conference on Availability, Reliability and Security, (1-6)

Regis G, Degiovanni R, D'Ippolito N and Aguirre N CLTSA: labelled transition system analyser with counting fluent support Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering, (979-983)

Hall J, Rapanotti L and Markov G A Phenomenal Basis for Hybrid Modelling 2017 IEEE International Conference on Information Reuse and Integration (IRI), (291-297)

Marin A and Rossi S (2017). On the relations between Markov chain lumpability and reversibility, Acta Informatica, 54:5, (447-485), Online publication date: 1-Aug-2017.

Attie P, Bensalem S, Bozga M, Jaber M, Sifakis J and Zaraket F (2018). Global and Local Deadlock Freedom in BIP, ACM Transactions on Software Engineering and Methodology, 26:3, (1-48), Online publication date: 31-Jul-2017.

Hall J and Rapanotti L (2017). A design theory for software engineering, Information and Software Technology, 87:C, (46-61), Online publication date: 1-Jul-2017.

Hasuo I (2017). Metamathematics for Systems Design, New Generation Computing, 35:3, (271-305), Online publication date: 1-Jul-2017.

Watanabe K, Ubayashi N, Fukamachi T, Nakamura S, Muraoka H and Kamei Y iArch-U Proceedings of the 9th International Workshop on Modelling in Software Engineering, (40-46)

Cimitile A, Mercaldo F, Martinelli F, Nardone V, Santone A and Vaglini G Model checking for mobile Android malware evolution Proceedings of the 5th International FME Workshop on Formal Methods in Software Engineering, (24-30)

Lange J, Ng N, Toninho B and Yoshida N (2017). Fencing off go: liveness and safety for channel-based programming, ACM SIGPLAN Notices, 52:1, (748-761), Online publication date: 11-May-2017.

Duarte L, Kramer J and Uchitel S (2017). Using contexts to extract models from code, Software and Systems Modeling (SoSyM), 16:2, (523-557), Online publication date: 1-May-2017.

Miller D (2017). Proof checking and logic programming, Formal Aspects of Computing, 29:3, (383-399), Online publication date: 1-May-2017.

Bonchi F, König B and Küpper S Up-To Techniques for Weighted Systems Proceedings, Part I, of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 10205, (535-552)

Pous D and Rot J Companions, Codensity and Causality Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 10203, (106-123)

Bujtor F, Sorokin L and Vogler W (2016). Testing Preorders for dMTS, ACM Transactions on Embedded Computing Systems, 16:2, (1-28), Online publication date: 14-Apr-2017.

Dedeić J, Pantović J and Pérez J Efficient compensation handling via subjective updates Proceedings of the Symposium on Applied Computing, (51-58)

Combi C, Sala P and Zerbato F Driving time-dependent paths in clinical BPMN processes Proceedings of the Symposium on Applied Computing, (743-750)

Martinelli F, Mercaldo F, Nardone V and Santone A How Discover a Malware using Model Checking Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, (902-904)

Alur R and Tripakis S (2017). Automatic Synthesis of Distributed Protocols, ACM SIGACT News, 48:1, (55-90), Online publication date: 10-Mar-2017.

Bhattacharyya A, Mokhov A and Pierce K (2017). An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems, Formal Aspects of Computing, 29:2, (251-307), Online publication date: 1-Mar-2017.

Banihashemi B, Giacomo G and Lesperance Y Abstraction in situation calculus action theories Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, (1048-1055)

Sangiorgi D (2017). Equations, Contractions, and Unique Solutions, ACM Transactions on Computational Logic, 18:1, (1-30), Online publication date: 31-Jan-2017.

Lange J, Ng N, Toninho B and Yoshida N Fencing off go: liveness and safety for channel-based programming Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (748-761)

Etchevers X, Salaün G, Boyer F, Coupaye T and DeźPalma N (2017). Reliable self-deployment of distributed cloud applications, Software—Practice & Experience, 47:1, (3-20), Online publication date: 1-Jan-2017.

Dumont C, Mourlin F and Nel L A mobile distributed system for remote resource access Proceedings of the 14th International Conference on Advances in Mobile Computing and Multi Media, (154-163)

Cai S, Gallina B, Nyström D and Seceleanu C A Formal Approach for Flexible Modeling and Analysis of Transaction Timeliness and Isolation Proceedings of the 24th International Conference on Real-Time Networks and Systems, (3-12)

Lee W, Vij V and Stevens K (2016). Timing Path-Driven Cycle Cutting for Sequential Controllers, ACM Transactions on Design Automation of Electronic Systems, 21:4, (1-25), Online publication date: 22-Sep-2016.

Cicirelli F and Nigro L Modelling and Verification of Mutual Exclusion Algorithms Proceedings of the 20th International Symposium on Distributed Simulation and Real-Time Applications, (136-144)

(2016). Nondeterministic Modal Interfaces, Theoretical Computer Science, 642:C, (24-53), Online publication date: 23-Aug-2016.

Zhang L and Jansen D (2016). A space-efficient simulation algorithm on probabilistic automata, Information and Computation, 249:C, (138-159), Online publication date: 1-Aug-2016.

D'Argenio P, Gebler D and Lee M (2016). A general SOS theory for the specification of probabilistic transition systems, Information and Computation, 249:C, (76-109), Online publication date: 1-Aug-2016.

Glabbeek R, Höfner P, Portmann M and Tan W (2016). Modelling and verifying the AODV routing protocol, Distributed Computing, 29:4, (279-315), Online publication date: 1-Aug-2016.

Pous D Coinduction All the Way Up Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (307-316)

Fokkink W and van Glabbeek R Divide and Congruence II Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (778-787)

Barbanera F, Dezani-Ciancaglini M and de’Liguoro U (2016). Reversible client/server interactions, Formal Aspects of Computing, 28:4, (697-722), Online publication date: 1-Jul-2016.

Mercaldo F, Nardone V, Santone A and Visaggio C Ransomware Steals Your Phone. Formal Methods Rescue It 36th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems - Volume 9688, (212-221)

Abd Alrahman Y, De Nicola R and Loreti M On the Power of Attribute-Based Communication 36th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems - Volume 9688, (1-18)

Bloem R, Jacobs S, Khalimov A, Konnov I, Rubin S, Veith H and Widder J (2016). Decidability in Parameterized Verification, ACM SIGACT News, 47:2, (53-64), Online publication date: 3-Jun-2016.

Nazarpour H, Falcone Y, Bensalem S, Bozga M and Combaz J Monitoring Multi-threaded Component-Based Systems Proceedings of the 12th International Conference on Integrated Formal Methods - Volume 9681, (141-159)

Bandyopadhyay S and Banerjee K Implementing an Efficient Path Based Equivalence Checker for Parallel Programs Proceedings of the ACM Workshop on Software Engineering Methods for Parallel and High Performance Applications, (3-10)

Mercaldo F, Nardone V, Santone A and Visaggio C Download malware? no, thanks Proceedings of the 4th FME Workshop on Formal Methods in Software Engineering, (22-28)

Nahabedian L, Braberman V, D'Ippolito N, Honiden S, Kramer J, Tei K and Uchitel S Assured and correct dynamic update of controllers Proceedings of the 11th International Symposium on Software Engineering for Adaptive and Self-Managing Systems, (96-107)

Francesco N, Lettieri G, Santone A and Vaglini G (2016). Heuristic search for equivalence checking, Software and Systems Modeling (SoSyM), 15:2, (513-530), Online publication date: 1-May-2016.

Colvin R (2016). Modelling and analysing neural networks using a hybrid process algebra, Theoretical Computer Science, 623:C, (15-64), Online publication date: 11-Apr-2016.

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.

Bres E, Glabbeek R and Höfner P A Timed Process Algebra for Wireless Networks with an Application in Routing Proceedings of the 25th European Symposium on Programming Languages and Systems - Volume 9632, (95-122)

Ferrer Fioriti L, Hashemi V, Hermanns H and Turrini A (2016). Deciding probabilistic automata weak bisimulation: theory and practice, Formal Aspects of Computing, 28:1, (109-143), Online publication date: 1-Mar-2016.

Bandyopadhyay S, Sarkar D and Mandal C An efficient path based equivalence checking for Petri net based models of programs Proceedings of the 9th India Software Engineering Conference, (70-79)

Janin D Walking Automata in Free Inverse Monoids Proceedings of the 42nd International Conference on SOFSEM 2016: Theory and Practice of Computer Science - Volume 9587, (314-328)

Åman Pohjola J and Parrow J Bisimulation up-to techniques for psi-calculi Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, (142-153)

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)

Rümmer P and Yi W Characterization of Simulation by Probabilistic Testing Essays Dedicated to Frank de Boer on Theory and Practice of Formal Methods - Volume 9660, (360-372)

Fortune S (2015). Equivalence and generalization in a layered network model, Journal of Computer and System Sciences, 81:8, (1698-1714), Online publication date: 1-Dec-2015.

Zhang Y, Zhu Z, Zhang J and Zhou Y (2015). Axiomatizing Lüttgen & Vogler's ready simulation for finite processes in CLLR, Journal of Applied Logic, 13:4, (654-675), Online publication date: 1-Dec-2015.

Bochmann G, Hilscher M, Linker S and Olderog E Synthesizing Controllers for Multi-lane Traffic Maneuvers Proceedings of the First International Symposium on Dependable Software Engineering: Theories, Tools, and Applications - Volume 9409, (71-86)

Sangiorgi D The Proof Technique of Unique Solutions of Contractions Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing - ICTAC 2015 - Volume 9399, (63-68)

Cristescu I, Krivine J and Varacca D Rigid Families for CCS and the $$\pi $$-calculus Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing - ICTAC 2015 - Volume 9399, (223-240)

De Ruvo G, Lettieri G, Martino D, Santone A and Vaglini G k-Bisimulation Revised Selected Papers of the 12th International Conference on Formal Aspects of Component Software - Volume 9539, (181-198)

Letichevsky A, Letychevskyi O, Peschanenko V and Weigert T Insertion Modeling and Symbolic Verification of Large Systems Proceedings of the 17th International SDL Forum on SDL 2015: Model-Driven Engineering for Smart Cities - Volume 9369, (3-18)

D'Ippolito N, Braberman V, Sykes D and Uchitel S Robust degradation and enhancement of robot mission behaviour in unpredictable environments Proceedings of the 1st International Workshop on Control Theory for Software Engineering, (26-33)

Gammie P, Hosking A and Engelhardt K (2015). Relaxing safely: verified on-the-fly garbage collection for x86-TSO, ACM SIGPLAN Notices, 50:6, (99-109), Online publication date: 7-Aug-2015.

Zavattaro G When to Move to Transfer Nets Essays Dedicated to Pierpaolo Degano on Programming Languages with Applications to Biology and Security - Volume 9465, (339-353)

Gorrieri R Language Representability of Finite P/T Nets Essays Dedicated to Pierpaolo Degano on Programming Languages with Applications to Biology and Security - Volume 9465, (262-282)

Chiarugi D, Falaschi M, Olarte C and Palamidessi C A Declarative View of Signaling Pathways Essays Dedicated to Pierpaolo Degano on Programming Languages with Applications to Biology and Security - Volume 9465, (183-201)

Bartoletti M, Cimoli T and Zunino R Compliance in Behavioural Contracts Essays Dedicated to Pierpaolo Degano on Programming Languages with Applications to Biology and Security - Volume 9465, (103-121)

Bonet B and Geffner H Policies that generalize Proceedings of the 24th International Conference on Artificial Intelligence, (2798-2804)

ter Beek M, Fantechi A, Gnesi S and Mazzanti F Using FMC for family-based analysis of software product lines Proceedings of the 19th International Conference on Software Product Line, (432-439)

Narayanaswamy G When truth is efficient: analysing concurrency Proceedings of the 2015 International Symposium on Software Testing and Analysis, (141-152)

He C and Huang M Branching Bisimilarity on Normed BPA Is EXPTIME-Complete Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (180-191)

Gammie P, Hosking A and Engelhardt K Relaxing safely: verified on-the-fly garbage collection for x86-TSO Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, (99-109)

Ceccarelli M, Cerulo L, De Ruvo G, Nardone V and Santone A Infer gene regulatory networks from time series data with probabilistic model checking Proceedings of the Third FME Workshop on Formal Methods in Software Engineering, (26-32)

Atlee J, Fahrenberg U and Legay A Measuring behaviour interactions between product-line features Proceedings of the Third FME Workshop on Formal Methods in Software Engineering, (20-25)

Regis G, Degiovanni R, D'Ippolito N and Aguirre N Specifying event-based systems with a counting fluent temporal logic Proceedings of the 37th International Conference on Software Engineering - Volume 1, (733-743)

Ben-David S, Sterin B, Atlee J and Beidu S Symbolic model checking of product-line requirements using SAT-based methods Proceedings of the 37th International Conference on Software Engineering - Volume 1, (189-199)

Sangiorgi D (2015). Equations, Contractions, and Unique Solutions, ACM SIGPLAN Notices, 50:1, (421-432), Online publication date: 11-May-2015.

Al-Humaimeedy A and Fernández M (2015). Enabling Synchronous and Asynchronous Communications in CSP for SOC, Electronic Notes in Theoretical Computer Science (ENTCS), 312:C, (69-88), Online publication date: 24-Apr-2015.

Murthy A, Islam M, Smolka S and Grosu R Computing bisimulation functions using SOS optimization and δ-decidability over the reals Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, (78-87)

Glabbeek R and Höfner P (2015). CCS, Acta Informatica, 52:2-3, (175-205), Online publication date: 1-Apr-2015.

Valmari A (2015). On constructibility and unconstructibility of LTS operators from other LTS operators, Acta Informatica, 52:2-3, (207-234), Online publication date: 1-Apr-2015.

Aceto L, Goriac E and Ingolfsdottir A (2015). A ground-complete axiomatization of stateless bisimilarity over Linda, Information Processing Letters, 115:2, (212-220), Online publication date: 1-Feb-2015.

Chen Y, Chen Y and Madelaine E (2015). Timed-pNets, Frontiers of Computer Science: Selected Publications from Chinese Universities, 9:1, (87-110), Online publication date: 1-Feb-2015.

Bonchi F and Pous D (2015). Hacking nondeterminism with induction and coinduction, Communications of the ACM, 58:2, (87-95), Online publication date: 28-Jan-2015.

Sangiorgi D Equations, Contractions, and Unique Solutions Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (421-432)

Chaudhuri K, Cimini M and Miller D A Lightweight Formalization of the Metatheory of Bisimulation-Up-To Proceedings of the 2015 Conference on Certified Programs and Proofs, (157-166)

Prabhakar P and Soto M Foundations of Quantitative Predicate Abstraction for Stability Analysis of Hybrid Systems Proceedings of the 16th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 8931, (318-335)

Salaün G and Ye L Debugging Process Algebra Specifications Proceedings of the 16th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 8931, (245-262)

Pan H, Li Y and Cao Y (2015). Lattice-valued simulations for quantitative transition systems, International Journal of Approximate Reasoning, 56:PA, (28-42), Online publication date: 1-Jan-2015.

Letichevsky A, Letychevskyi O, Peschanenko V and Huba A (2015). Generating Symbolic Traces in the Insertion Modeling System, Cybernetics and Systems Analysis, 51:1, (5-15), Online publication date: 1-Jan-2015.

Lange M, Lozes E and Vargas Guzmán M (2014). Model-checking process equivalences, Theoretical Computer Science, 560:P3, (326-347), Online publication date: 4-Dec-2014.

Song C, Ge T, Chen C and Wang J (2014). Event pattern matching over graph streams, Proceedings of the VLDB Endowment, 8:4, (413-424), Online publication date: 1-Dec-2014.

Sinha R, Girault A, Goessler G and Roop P (2014). A Formal Approach to Incremental Converter Synthesis for System-on-Chip Design, ACM Transactions on Design Automation of Electronic Systems, 20:1, (1-30), Online publication date: 18-Nov-2014.

Castellan S, Hayman J, Lasson M and Winskel G (2014). Strategies as Concurrent Processes, Electronic Notes in Theoretical Computer Science (ENTCS), 308:C, (87-107), Online publication date: 29-Oct-2014.

Beek M and Vink E Towards Modular Verification of Software Product Lines with mCRL2 Part I of the Proceedings of the 6th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change - Volume 8802, (368-385)

Cabri G, Capodieci N, Cesari L, Nicola R, Pugliese R, Tiezzi F and Zambonelli F Self-expression and Dynamic Attribute-Based Ensembles in SCEL Part I of the Proceedings of the 6th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change - Volume 8802, (147-163)

ter Beek M and de Vink E Software product line analysis with mCRL2 Proceedings of the 18th International Software Product Line Conference: Companion Volume for Workshops, Demonstrations and Tools - Volume 2, (78-85)

Ahmed K, Newton M, Wen L and Sattar A Formalisation of the integration of behavior trees Proceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering, (779-784)

Bonchi F, Gadducci F and Monreale G (2014). A General Theory of Barbs, Contexts, and Labels, ACM Transactions on Computational Logic, 15:4, (1-27), Online publication date: 1-Aug-2014.

Göller S and Lin A (2014). Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems, ACM Transactions on Computational Logic, 15:4, (1-28), Online publication date: 1-Aug-2014.

Bonchi F, Petrişan D, Pous D and Rot J Coinduction up-to in a fibrational setting Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (1-9)

Bernardo M, Sangiorgi D and Vignudelli V On the discriminating power of passivation and higher-order interaction Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (1-10)

Pan H, Zhang M, Wu H and Chen Y (2014). Quantitative Analysis of Lattice-valued Kripke Structures, Fundamenta Informaticae, 135:3, (269-293), Online publication date: 1-Jul-2014.

Hanxleden R, Mendler M, Aguado J, Duderstadt B, Fuhrmann I, Motika C, Mercer S, O'brien O and Roop P (2014). Sequentially Constructive Concurrency—A Conservative Extension of the Synchronous Model of Computation, ACM Transactions on Embedded Computing Systems, 13:4s, (1-26), Online publication date: 1-Jul-2014.

Nicola R, Loreti M, Pugliese R and Tiezzi F (2014). A Formal Approach to Autonomic Systems Programming, ACM Transactions on Autonomous and Adaptive Systems, 9:2, (1-29), Online publication date: 1-Jul-2014.

Bliudze S, Sifakis J, Bozga M and Jaber M Architecture internalisation in BIP Proceedings of the 17th international ACM Sigsoft symposium on Component-based software engineering, (169-178)

von Hanxleden R, Duderstadt B, Motika C, Smyth S, Mendler M, Aguado J, Mercer S and O'Brien O SCCharts: sequentially constructive statecharts for safety-critical applications Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, (372-383)

von Hanxleden R, Duderstadt B, Motika C, Smyth S, Mendler M, Aguado J, Mercer S and O'Brien O (2014). SCCharts: sequentially constructive statecharts for safety-critical applications, ACM SIGPLAN Notices, 49:6, (372-383), Online publication date: 5-Jun-2014.

Böhm S, Göller S and Jančar P (2014). Bisimulation equivalence and regularity for real-time one-counter automata, Journal of Computer and System Sciences, 80:4, (720-743), Online publication date: 1-Jun-2014.

Doan T, Yao Y, Alechina N and Logan B Verifying heterogeneous multi-agent programs Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, (149-156)

Xing C (2014). Adding coinduction into discrete mathematics, Journal of Computing Sciences in Colleges, 29:5, (84-90), Online publication date: 1-May-2014.

Francesco N, Lettieri G, Santone A and Vaglini G (2014). GreASE, ACM Transactions on Software Engineering and Methodology, 23:3, (1-26), Online publication date: 1-May-2014.

Colvin R (2014). An operational semantics for object-oriented concepts based on the class hierarchy, Formal Aspects of Computing, 26:3, (491-535), Online publication date: 1-May-2014.

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)

Bocchi L, Melgratti H and Tuosto E Resolving Non-determinism in Choreographies Proceedings of the 23rd European Symposium on Programming Languages and Systems - Volume 8410, (493-512)

Gruska D (2014). Simulation Opacity, Fundamenta Informaticae, 133:2-3, (165-179), Online publication date: 1-Apr-2014.

Feng Y, Deng Y and Ying M (2014). Symbolic Bisimulation for Quantum Processes, ACM Transactions on Computational Logic, 15:2, (1-32), Online publication date: 1-Apr-2014.

Lin H and Antsaklis P (2014). Hybrid Dynamical Systems, Foundations and Trends in Systems and Control, 1:1, (1-172), Online publication date: 31-Mar-2014.

Lu L and Kim D (2014). Required behavior of sequence diagrams, ACM Transactions on Software Engineering and Methodology, 23:2, (1-28), Online publication date: 1-Mar-2014.

Pan H, Cao Y, Zhang M and Chen Y (2014). Simulation for lattice-valued doubly labeled transition systems, International Journal of Approximate Reasoning, 55:3, (797-811), Online publication date: 1-Mar-2014.

Cooper R and Guest O (2014). Implementations are not specifications, Cognitive Systems Research, 27:C, (42-49), Online publication date: 1-Mar-2014.

Derrick J and Boiten E (2012). Relational concurrent refinement part III: traces, partial relations and automata, Formal Aspects of Computing, 26:2, (407-432), Online publication date: 1-Mar-2014.

Arpit , Shafie A and Wan Ahmad W Automata for Modeling the Distributed Probabilistic Reversible Processes Proceedings of the First International Conference on Applied Algorithms - Volume 8321, (122-136)

Szpyrka M, Matyasik P, Mrówka R and Kotulski L (2014). Formal Description of Alvis Language with α0 System Layer, Fundamenta Informaticae, 129:1-2, (161-176), Online publication date: 1-Jan-2014.

Ma S, Cao Y, Fan W, Huai J and Wo T (2014). Strong simulation, ACM Transactions on Database Systems, 39:1, (1-46), Online publication date: 1-Jan-2014.

Fontana P and Cleaveland R (2014). A menagerie of timed automata, ACM Computing Surveys, 46:3, (1-56), Online publication date: 1-Jan-2014.

Sun Y, Lin H and Chen B (2014). Bisimilarity enforcing supervisory control for deterministic specifications, Automatica (Journal of IFAC), 50:1, (287-290), 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)

Bonchi F, Caltais G, Pous D and Silva A Brzozowski's and Up-To Algorithms for Must Testing Proceedings of the 11th Asian Symposium on Programming Languages and Systems - Volume 8301, (1-16)

Ren Y, Gröner G, Lemcke J, Rahmani T, Friesen A, Zhao Y, Pan J and Staab S Process Refinement Validation and Explanation with Ontology Reasoning Proceedings of the 11th International Conference on Service-Oriented Computing - Volume 8274, (515-523)

Fleischmann A, Kannengiesser U, Schmidt W and Stary C Subject-Oriented Modeling and Execution of Multi-agent Business Processes Proceedings of the 2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) - Volume 02, (138-145)

Zhang S, Sun J, Suny C, Liuz Y, Ma J and Dong J Constraint-based automatic symmetry detection Proceedings of the 28th IEEE/ACM International Conference on Automated Software Engineering, (15-25)

Gammie P (2013). Synchronous digital circuits as functional programs, ACM Computing Surveys, 46:2, (1-27), Online publication date: 1-Nov-2013.

Uchitel S, Alrajeh D, Ben-David S, Braberman V, Chechik M, Caso G, D'ippolito N, Fischbein D, Garbervetsky D, Kramer J, Russo A and Sibay G (2013). Supporting incremental behaviour model elaboration, Computer Science - Research and Development, 28:4, (279-293), Online publication date: 1-Nov-2013.

Sharma A and Katoen J Layered Reduction for Modal Specification Theories Formal Aspects of Component Software, (329-347)

Campinas S, Delbru R and Tummarello G Efficiency and precision trade-offs in graph summary algorithms Proceedings of the 17th International Database Engineering & Applications Symposium, (38-47)

Nicola R, Latella D, Loreti M and Massink M (2013). A uniform definition of stochastic process calculi, ACM Computing Surveys, 46:1, (1-35), Online publication date: 1-Oct-2013.

Yang H, Cai C, Peng L, Zhao X, Qiu Z and Qin S (2013). Algorithms for checking channel passing in web service choreography, Frontiers of Computer Science: Selected Publications from Chinese Universities, 7:5, (710-728), Online publication date: 1-Oct-2013.

Prabhakar P, Liu J and Murray R Pre-orders for reasoning about stability properties with respect to input of hybrid systems Proceedings of the Eleventh ACM International Conference on Embedded Software, (1-10)

Bernardi G and Hennessy M Compliance and Testing Preorders Differ Revised Selected Papers of the SEFM 2013 Collocated Workshops on Software Engineering and Formal Methods - Volume 8368, (69-81)

Danvy O and Zerny I A synthetic operational account of call-by-need evaluation Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, (97-108)

Merro M and Sibilio E (2013). A calculus of trustworthy ad hoc networks, Formal Aspects of Computing, 25:5, (801-832), Online publication date: 1-Sep-2013.

Borgström J, Gutkovas R, Parrow J, Victor B and Pohjola J A Sorted Semantic Framework for Applied Process Calculi Extended Abstract 8th International Symposium on Trustworthy Global Computing - Volume 8358, (103-118)

Zamani M and Abate A Symbolic control of stochastic switched systems via finite abstractions Proceedings of the 10th international conference on Quantitative Evaluation of Systems, (305-321)

Bernardi G and Hennessy M Mutually testing processes Proceedings of the 24th international conference on Concurrency Theory, (61-75)

ter Beek M, Lafuente A and Petrocchi M Combining declarative and procedural views in the specification and analysis of product families Proceedings of the 17th International Software Product Line Conference co-located workshops, (10-17)

Dong R, Faber J, Ke W and Liu Z rCOS Unifying Theories of Programming and Formal Engineering Methods, (1-66)

Carver R and Lei Y A Modular Approach to Model-Based Testing of Concurrent Programs Proceedings of the International Conference on Multicore Software Engineering, Performance, and Tools - Volume 8063, (85-96)

Fan W, Wang X and Wu Y (2013). Incremental graph pattern matching, ACM Transactions on Database Systems, 38:3, (1-47), Online publication date: 1-Aug-2013.

Endrullis J, Hendriks D and Bodin M Circular coinduction in coq using bisimulation-up-to techniques Proceedings of the 4th international conference on Interactive Theorem Proving, (354-369)

Kushik N and Yevtushenko N On the length of homing sequences for nondeterministic finite state machines Proceedings of the 18th international conference on Implementation and Application of Automata, (220-231)

Harris W, Jin G, Lu S and Jha S Validating Library Usage Interactively Proceedings of the 25th International Conference on Computer Aided Verification - Volume 8044, (796-812)

Xu H, Rajasekar A, Moore R and Wan M Distributed ECA rules for data management policies Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web, (203-217)

Fan W Querying big social data Proceedings of the 29th British National conference on Big Data, (14-28)

Franke-Arnold S, Gay S and Puthoor I Quantum process calculus for linear optical quantum computing Proceedings of the 5th international conference on Reversible Computation, (234-246)

Benedikt M, Goller S, Kiefer S and Murawski A Bisimilarity of Pushdown Automata is Nonelementary Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, (488-498)

Eisentraut C, Hermanns H, Katoen J and Zhang L A semantics for every GSPN Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency, (90-109)

Schätzle A, Neu A, Lausen G and Przyjaciel-Zablocki M Large-scale bisimulation of RDF graphs Proceedings of the Fifth Workshop on Semantic Web Information Management, (1-8)

Fleischmann A, Börger E and Lerchner H Subject-Orientation as a method to specify the cooperation of active entities in the ucepcortex project Proceedings of the 6th international conference on Advances in Brain Inspired Cognitive Systems, (328-337)

Ševčík J, Vafeiadis V, Zappa Nardelli F, Jagannathan S and Sewell P (2013). CompCertTSO, Journal of the ACM, 60:3, (1-50), Online publication date: 1-Jun-2013.

Padilla J, Tolk A and Diallo S M&S methodological challenges Proceedings of the Emerging M&S Applications in Industry & Academia / Modeling and Humanities Symposium, (1-9)

Garavel H, Lang F, Mateescu R and Serwe W (2013). CADP 2011, International Journal on Software Tools for Technology Transfer (STTT), 15:2, (89-107), Online publication date: 1-Apr-2013.

Dreier J, Ene C, Lafourcade P and Lakhnech Y On unique decomposition of processes in the applied π-calculus Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures, (50-64)

Triki A, Combaz J, Bensalem S and Sifakis J Model-Based implementation of parallel real-time systems Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering, (235-249)

Eisentraut C, Hermanns H, Schuster J, Turrini A and Zhang L The quest for minimal quotients for probabilistic automata Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems, (16-31)

Bonsangue M, Milius S and Silva A (2013). Sound and Complete Axiomatizations of Coalgebraic Language Equivalence, ACM Transactions on Computational Logic, 14:1, (1-52), Online publication date: 1-Feb-2013.

Bonchi F and Pous D (2013). Checking NFA equivalence with bisimulations up to congruence, ACM SIGPLAN Notices, 48:1, (457-468), Online publication date: 23-Jan-2013.

Bonchi F and Pous D Checking NFA equivalence with bisimulations up to congruence Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (457-468)

Gruska D (2013). Information Flow Testing, Fundamenta Informaticae, 128:1-2, (81-95), Online publication date: 1-Jan-2013.

Fioravanti F, Pettorossi A, Proietti M and Senni V (2013). Proving Theorems by Program Transformation, Fundamenta Informaticae, 127:1-4, (115-134), Online publication date: 1-Jan-2013.

Fu Y The value-passing calculus Theories of Programming and Formal Methods, (166-195)

Chen Y Algebraic program semantics for supercomputing Theories of Programming and Formal Methods, (118-135)

Leroy X Mechanized semantics for compiler verification Proceedings of the Second international conference on Certified Programs and Proofs, (4-6)

Popescu A, Hölzl J and Nipkow T Proving concurrent noninterference Proceedings of the Second international conference on Certified Programs and Proofs, (109-125)

Mouradian A and Augé-Blum I Modeling local broadcast behavior of wireless sensor networks with timed automata for model checking of WCTT Proceeings of the 2nd International Workshop on Worst-Case Traversal Time, (23-30)

Feng Y, Duan R and Ying M (2012). Bisimulation for Quantum Processes, ACM Transactions on Programming Languages and Systems, 34:4, (1-43), Online publication date: 1-Dec-2012.

Ware S and Malik R (2012). Conflict-preserving abstraction of discrete event systems using annotated automata, Discrete Event Dynamic Systems, 22:4, (451-477), Online publication date: 1-Dec-2012.

Kułakowski K and Szmuc T Modeling robot behavior with CCL Proceedings of the Third international conference on Simulation, Modeling, and Programming for Autonomous Robots, (40-51)

Liu Z and Roychoudhury A (2012). Relating software validation to technology trends, International Journal on Software Tools for Technology Transfer (STTT), 14:6, (631-638), Online publication date: 1-Nov-2012.

Gebler D, Hashemi V and Turrini A Computing Behavioral Relations for Probabilistic Concurrent Systems Advanced Lectures of the International Autumn School on Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems - Volume 8453, (117-155)

Budde C, D'Argenio P, Sánchez Terraf P and Wolovick N A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems Advanced Lectures of the International Autumn School on Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems - Volume 8453, (67-86)

El Fatni A Modelling and analysis of the split phase multi-channel MAC approach Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems, (285-294)

Güdemann M, Salaün G and Ouederni M Counterexample guided synthesis of monitors for realizability enforcement Proceedings of the 10th international conference on Automated Technology for Verification and Analysis, (238-253)

Wijs A and Engelen L Incremental formal verification for model refining Proceedings of the Workshop on Model-Driven Engineering, Verification and Validation, (29-34)

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)

Jörges S, Lamprecht A, Margaria T, Schaefer I and Steffen B (2012). A constraint-based variability modeling framework, International Journal on Software Tools for Technology Transfer (STTT), 14:5, (511-530), Online publication date: 1-Oct-2012.

Deng Y and Feng Y Open bisimulation for quantum processes Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science, (119-133)

Sher F and Katoen J Compositional abstraction techniques for probabilistic automata Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science, (325-341)

Beffara E and Mogbil V Proofs as executions Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science, (280-294)

Luttik B Unique parallel decomposition in branching and weak bisimulation semantics Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science, (250-264)

Huang Y, Zhao Y, Shi J, Zhu H and Qin S Investigating time properties of interrupt-driven programs Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications, (131-146)

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)

Xu L Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus Revised Selected Papers of the 7th International Symposium on Trustworthy Global Computing - Volume 8191, (198-212)

Aarts F, Heidarian F and Vaandrager F A theory of history dependent abstractions for learning interface automata Proceedings of the 23rd international conference on Concurrency Theory, (240-255)

Gnesi S and Petrocchi M Towards an executable algebra for product lines Proceedings of the 16th International Software Product Line Conference - Volume 2, (66-73)

Behrisch M, Kerkhoff S and Power J (2012). Category Theoretic Understandings of Universal Algebra and its Dual, Electronic Notes in Theoretical Computer Science (ENTCS), 286, (5-16), Online publication date: 1-Sep-2012.

Bonchi F, Bonsangue M, Caltais G, Rutten J and Silva A (2012). Final Semantics for Decorated Traces, Electronic Notes in Theoretical Computer Science (ENTCS), 286, (73-86), Online publication date: 1-Sep-2012.

Teodosiu D (2012). A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources, Electronic Notes in Theoretical Computer Science (ENTCS), 286, (307-321), Online publication date: 1-Sep-2012.

Cimini M, Mousavi M, Reniers M and Gabbay M (2012). Nominal SOS, Electronic Notes in Theoretical Computer Science (ENTCS), 286, (103-116), Online publication date: 1-Sep-2012.

de Oliveira Guimarães J (2012). Review of models of computation, ACM SIGACT News, 43:3, (28-31), Online publication date: 27-Aug-2012.

Girard A and Zheng G (2012). Verification of Safety and Liveness Properties of Metric Transition Systems, ACM Transactions on Embedded Computing Systems, 11:S2, (1-23), Online publication date: 1-Aug-2012.

Milhau J, Gervais F, Laleau R and Frappier M (2012). Refinement patterns for ASTD, ACM SIGSOFT Software Engineering Notes, 37:4, (1-8), Online publication date: 16-Jul-2012.

Aceto L, Carayol A, Ésik Z and Ingólfsdóttir A Algebraic synchronization trees and processes Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II, (30-41)

Fu H Computing game metrics on markov decision processes Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II, (227-238)

Guha S, Narayan C and Arun-Kumar S On decidability of prebisimulation for timed automata Proceedings of the 24th international conference on Computer Aided Verification, (444-461)

Majumdar R and Zamani M Approximately bisimilar symbolic models for digital control systems Proceedings of the 24th international conference on Computer Aided Verification, (362-377)

Gruska D (2012). Quantification of Positive and Negative Attacker's Information, Fundamenta Informaticae, 120:3-4, (311-324), Online publication date: 1-Jul-2012.

Gruska D (2012). Informational Analysis of Security and Integrity, Fundamenta Informaticae, 120:3-4, (295-309), Online publication date: 1-Jul-2012.

Shan Z and Kumar A (2012). Optimal Adapter Creation for Process Composition in Synchronous vs. Asynchronous Communication, ACM Transactions on Management Information Systems, 3:2, (1-33), Online publication date: 1-Jul-2012.

Hennessy M (2012). Exploring probabilistic bisimulations, part I, Formal Aspects of Computing, 24:4-6, (749-768), Online publication date: 1-Jul-2012.

Swaminathan M, Katoen J and Olderog E (2012). Layered reasoning for randomized distributed algorithms, Formal Aspects of Computing, 24:4-6, (477-496), Online publication date: 1-Jul-2012.

Bodei C, Brodo L and Chiarugi D (2012). Control Flow Analysis of Generalised Boolean Networks, Electronic Notes in Theoretical Computer Science (ENTCS), 284:C, (3-22), Online publication date: 20-Jun-2012.

Cuomo A, Santone A and Villano U A novel approach based on formal methods for clone detection Proceedings of the 6th International Workshop on Software Clones, (8-14)

Boudjadar A, Bodeveix J and Filali M Revising and extending the uppaal communication mechanism Proceedings of the 11th international conference on Software Composition, (114-131)

Ponce de León H, Haar S and Longuet D Conformance relations for labeled event structures Proceedings of the 6th international conference on Tests and Proofs, (83-98)

Xue J and Dong X A fully abstract view for local cause semantics Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing, (198-209)

Abiteboul S, Bourhis P and Vianu V (2012). Comparing workflow specification languages, ACM Transactions on Database Systems, 37:2, (1-59), Online publication date: 1-May-2012.

Borri A, Pola G and Di Benedetto M A symbolic approach to the design of nonlinear networked control systems Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control, (255-264)

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 (2012). On the Behaviours Produced by Instruction Sequences under Execution, Fundamenta Informaticae, 120:2, (111-144), Online publication date: 1-Apr-2012.

Goldstein-Lev A and Ariav G (2012). Configuring Systems of Massively Distributed, Autonomous and Interdependent Decision Makers, International Journal of Decision Support System Technology, 4:2, (17-41), Online publication date: 1-Apr-2012.

Fan W Graph pattern matching revised for social network analysis Proceedings of the 15th International Conference on Database Theory, (8-21)

Poizat P and Salaün G Checking the realizability of BPMN 2.0 choreographies Proceedings of the 27th Annual ACM Symposium on Applied Computing, (1927-1934)

Wirsing M, Eckhardt J, Mühlbauer T and Meseguer J Design and analysis of cloud-based architectures with KLAIM and maude Proceedings of the 9th international conference on Rewriting Logic and Its Applications, (54-82)

D'Argenio P and Lee M Probabilistic transition system specification Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures, (452-466)

Chen D, van Breugel F and Worrell J On the complexity of computing probabilistic bisimilarity Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures, (437-451)

van Glabbeek R, Goltz U and Schicke-Uffmann J On distributability of petri nets Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures, (331-345)

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)

Fischbein D, D’Ippolito N, Brunet G, Chechik M and Uchitel S (2012). Weak Alphabet Merging of Partial Behavior Models, ACM Transactions on Software Engineering and Methodology, 21:2, (1-47), Online publication date: 1-Mar-2012.

Jeffrey A LTL types FRP Proceedings of the sixth workshop on Programming languages meets program verification, (49-60)

Aceto L, de Frutos-Escrig D, Gregorio-Rodríguez C and Ingólfsdóttir A The equational theory of weak complete simulation semantics over BCCSP Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science, (141-152)

Knight S, Mardare R and Panangaden P Combining epistemic logic and hennessy-milner logic Logic and Program Semantics, (219-243)

Elhog-Benzina D, Haddad S and Hennicker R Refinement and asynchronous composition of modal petri nets Transactions on Petri Nets and Other Models of Concurrency V, (96-120)

Tsankov P, Torabi-Dashti M and Basin D Constructing mid-points for two-party asynchronous protocols Proceedings of the 15th international conference on Principles of Distributed Systems, (481-496)

Ma S, Cao Y, Fan W, Huai J and Wo T (2011). Capturing topology in graph pattern matching, Proceedings of the VLDB Endowment, 5:4, (310-321), Online publication date: 1-Dec-2011.

Xing Z, Sun J, Liu Y and Dong J Differencing labeled transition systems Proceedings of the 13th international conference on Formal methods and software engineering, (537-552)

Bodeveix J, Boudjadar A and Filali M An alternative definition for timed automata composition Proceedings of the 9th international conference on Automated technology for verification and analysis, (105-119)

Orlandini A, Finzi A, Cesta A and Fratini S TGA-based controllers for flexible plan execution Proceedings of the 34th Annual German conference on Advances in artificial intelligence, (233-245)

Mumme M and Ciardo G A fully symbolic bisimulation algorithm Proceedings of the 5th international conference on Reachability problems, (218-230)

Dinculescu M, Hundt C, Panangaden P, Pineau J and Precup D The duality of state and observation in probabilistic transition systems Proceedings of the 9th international conference on Logic, Language, and Computation, (206-230)

Oliveira M, Déharbe D and Cruz L B to CSP migration Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications, (44-59)

Degasperi A and Calder M Multi-scale modelling of biological systems in process algebra with multi-way synchronisation Proceedings of the 9th International Conference on Computational Methods in Systems Biology, (195-208)

Göller S and Lin A Refining the process rewrite systems hierarchy via ground tree rewrite systems Proceedings of the 22nd international conference on Concurrency theory, (543-558)

Ouaknine J, Palikareva H, Roscoe A and Worrell J Static livelock analysis in CSP Proceedings of the 22nd international conference on Concurrency theory, (389-403)

He C The decidability of the reachability problem for CCS! Proceedings of the 22nd international conference on Concurrency theory, (373-388)

Song L, Zhang L and Godskesen J Bisimulations meet PCTL equivalences for probabilistic automata Proceedings of the 22nd international conference on Concurrency theory, (108-123)

Aceto L, de Frutos Escrig D, Gregorio-Rodríguez C and Ingolfsdottir A Axiomatizing weak ready simulation semantics over BCCSP Proceedings of the 8th international conference on Theoretical aspects of computing, (7-24)

Aceto L, Caltais G, Goriac E and Ingolfsdottir A PREG axiomatizer Proceedings of the 4th international conference on Algebra and coalgebra in computer science, (378-385)

Bacci G, Danos V and Kammar O On the statistical thermodynamics of reversible communicating processes Proceedings of the 4th international conference on Algebra and coalgebra in computer science, (1-18)

Bertolini C, Schäf M and Stolz V Towards a formal integrated model of collaborative healthcare workflows Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems, (57-74)

Baeten J, Luttik B and van Tilburg P Reactive turing machines Proceedings of the 18th international conference on Fundamentals of computation theory, (348-359)

Goncharov S and Schröder L A coinductive calculus for asynchronous side-effecting processes Proceedings of the 18th international conference on Fundamentals of computation theory, (276-287)

Preda M and Di Giusto C Hunting distributed malware with the κ-calculus Proceedings of the 18th international conference on Fundamentals of computation theory, (102-113)

Gruska D (2011). Gained and Excluded Private Actions by Process Observations, Fundamenta Informaticae, 109:3, (281-295), Online publication date: 1-Aug-2011.

Lodaya K, Mukund M and Phawade R Kleene theorems for product systems Proceedings of the 13th international conference on Descriptional complexity of formal systems, (235-247)

Arpit and Kumar A Refjav Proceedings of the International Conference on Advances in Computing and Artificial Intelligence, (150-154)

Vasilescu A and Băicoianu A Algebraic model for the CPU logic unit behaviour Proceedings of the 15th WSEAS international conference on Computers, (521-526)

Mateescu R and Wijs A Property-dependent reductions for the modal Mu-calculus Proceedings of the 18th international SPIN conference on Model checking software, (2-19)

Klein U and Namjoshi K Formalization and automated verification of RESTful behavior Proceedings of the 23rd international conference on Computer aided verification, (541-556)

Kushik N, El-Fakih K and Yevtushenko N Preset and adaptive homing experiments for nondeterministic finite state machines Proceedings of the 16th international conference on Implementation and application of automata, (215-224)

Deng Y and Hennessy M On the semantics of Markov automata Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II, (307-318)

Clemente L Büchi automata can have smaller quotients Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II, (258-270)

Bergstra J and Middelburg C (2011). Thread algebra for poly-threading, Formal Aspects of Computing, 23:4, (567-583), Online publication date: 1-Jul-2011.

Letichevsky A, Letychevskyi O and Peschanenko V Insertion modeling system Proceedings of the 8th international conference on Perspectives of System Informatics, (262-273)

D'Errico L and Loreti M Context aware specification and verification of distributed systems Proceedings of the 6th international conference on Trustworthy Global Computing, (142-159)

Bernardo M Weak markovian bisimulation congruences and exact CTMC-Level aggregations for sequential processes Proceedings of the 6th international conference on Trustworthy Global Computing, (89-103)

Zhang C Conditional information flow policies and unwinding relations Proceedings of the 6th international conference on Trustworthy Global Computing, (227-241)

Kouzapas D, Yoshida N and Honda K On asynchronous session semantics Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems, (228-243)

Kouzapas D and Philippou A A process calculus for dynamic networks Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems, (213-227)

Derrick J and Boiten E Relational concurrent refinement Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems, (121-137)

Bravetti M, Di Giusto C, Pérez J and Zavattaro G Adaptable processes Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems, (90-105)

Kindler E Integrating behaviour in software models Proceedings of the Third Workshop on Behavioural Modelling, (41-48)

Sanchez A, Barbosa L and Riesco D A language for behavioural modelling of architectural patterns Proceedings of the Third Workshop on Behavioural Modelling, (17-24)

Roversi L Linear lambda calculus and deep inference Proceedings of the 10th international conference on Typed lambda calculi and applications, (184-197)

Aceto L, Cimini M, Ingolfsdottir A, Mousavi M and Reniers M Rule formats for distributivity Proceedings of the 5th international conference on Language and automata theory and applications, (80-91)

Santone A Clone detection through process algebras and Java bytecode Proceedings of the 5th International Workshop on Software Clones, (73-74)

Nielson F, Nanz S and Nielson H (2011). Modal abstractions of concurrent behavior, ACM Transactions on Computational Logic, 12:3, (1-40), Online publication date: 1-May-2011.

Dodig-Crnkovic G (2011). Significance of Models of Computation, from Turing Model to Natural Computation, Minds and Machines, 21:2, (301-322), Online publication date: 1-May-2011.

Deng J, Choi B, Xu J and Bhowmick S Optimizing incremental maintenance of minimal bisimulation of cyclic graphs Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I, (543-557)

Costa D, Niqui M and Rutten J Intentional automata Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering, (335-342)

Courbis R Rewriting approximations for properties verification over CCS specifications Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering, (299-315)

He C, Fu Y and Fu H Decidability of behavioral equivalences in process calculi with name scoping Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering, (284-298)

Aceto L, Fábregas I, de Frutos Escrig D, Ingólfsdóttir A and Palomino M Relating modal refinements, covariant-contravariant simulations and partial bisimulations Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering, (268-283)

Cámara J, Girard A and Gössler G Synthesis of switching controllers using approximately bisimilar multiscale abstractions Proceedings of the 14th international conference on Hybrid systems: computation and control, (191-200)

Berendsen J, Gebremichael B, Vaandrager F and Zhang M (2011). Formal specification and analysis of zeroconf using uppaalS, ACM Transactions on Embedded Computing Systems, 10:3, (1-32), Online publication date: 1-Apr-2011.

Aceto L, de Frutos Escrig D, Gregorio-Rodríguez C and Ingolfsdottir A (2011). Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet, Information Processing Letters, 111:9, (408-413), Online publication date: 1-Apr-2011.

Basu S and Bultan T Choreography conformance via synchronizability Proceedings of the 20th international conference on World wide web, (795-804)

Delzanno G, Sangnier A and Zavattaro G On the power of cliques in the parameterized verification of Ad Hoc networks Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software, (441-455)

Stahl C and Vogler W A trace-based view on operating guidelines Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software, (411-425)

Abiteboul S, Bourhis P and Vianu V Comparing workflow specification languages Proceedings of the 14th International Conference on Database Theory, (78-89)

Aldini A and Bernardo M (2011). Component-oriented verification of noninterference, Journal of Systems Architecture: the EUROMICRO Journal, 57:3, (282-293), Online publication date: 1-Mar-2011.

Ŝevčik J, Vafeiadis V, Zappa Nardelli F, Jagannathan S and Sewell P Relaxed-memory concurrency and verified compilation Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (43-54)

Ŝevčik J, Vafeiadis V, Zappa Nardelli F, Jagannathan S and Sewell P (2011). Relaxed-memory concurrency and verified compilation, ACM SIGPLAN Notices, 46:1, (43-54), Online publication date: 26-Jan-2011.

Siegel S and Gopalakrishnan G Formal analysis of message passing Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation, (2-18)

Wolf K, Stahl C, Weinberg D, Ott J and Danitz R (2011). Guaranteeing Weak Termination in Service Discovery, Fundamenta Informaticae, 108:1-2, (151-180), Online publication date: 1-Jan-2011.

Potop-Butucaru D, Sorel Y, de Simone R and Talpin J (2011). From Concurrent Multi-clock Programs to Deterministic Asynchronous Implementations, Fundamenta Informaticae, 108:1-2, (91-118), Online publication date: 1-Jan-2011.

Kleijn J and Koutny M Causality in structured occurrence nets Dependable and Historic Computing, (283-297)

Ésik Z and Hajgató T Kleene theorem in partial conway theories with applications Algebraic Foundations in Computer Science, (72-93)

Hartmann L, Jones N, Simonsen J and Vrist S Computational biology Formal modeling, (403-433)

Ferreira C, Lanese I, Ravara A, Vieira H and Zavattaro G Advanced mechanisms for service combination and transactions Rigorous software engineering for service-oriented systems, (302-325)

Lanese I, Ravara A and Vieira H Behavioral theory for session-oriented calculi Rigorous software engineering for service-oriented systems, (189-213)

Gorrieri R and Vernali M On intransitive non-interference in some models of concurrency Foundations of security analysis and design VI, (125-151)

Sangiorgi D, Kobayashi N and Sumii E (2011). Environmental bisimulations for higher-order languages, ACM Transactions on Programming Languages and Systems, 33:1, (1-69), Online publication date: 1-Jan-2011.

Bourdonov I and Kossatchev A (2011). Specification completion for IOCO, Programming and Computing Software, 37:1, (1-14), Online publication date: 1-Jan-2011.

Li L, Hooman J and Voeten J Connecting Technical and Non-technical Views of System Architectures Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing, (592-599)

Georgiou C, Hadjiprocopiou P and Musial P On the automated implementation of time-based paxos using the IOA compiler Proceedings of the 14th international conference on Principles of distributed systems, (235-252)

Bergstra J and Middelburg C (2010). An Interface Group for Process Components, Fundamenta Informaticae, 99:4, (355-382), Online publication date: 1-Dec-2010.

Ma Y and Zhang M (2010). Topological Construction of Parameterized Bisimulation Limit, Electronic Notes in Theoretical Computer Science (ENTCS), 257, (55-70), Online publication date: 1-Dec-2010.

Baldan P, Bonchi F, Gadducci F and Monreale G Concurrency can't be observed, asynchronously Proceedings of the 8th Asian conference on Programming languages and systems, (424-438)

He C Model independent order relations for processes Proceedings of the 8th Asian conference on Programming languages and systems, (408-423)

Chen Y and Sanders J UTP and sustainability Proceedings of the Third international conference on Unifying theories of programming, (46-73)

Hinze R (2010). Concrete stream calculus, Journal of Functional Programming, 20:5-6, (463-535), Online publication date: 1-Nov-2010.

Halpern J and Petride S (2010). A knowledge-based analysis of global function computation, Distributed Computing, 23:3, (197-224), Online publication date: 1-Nov-2010.

Lang F, Salaün G, Hérilier R, Kramer J and Magee J (2010). Translating FSP into LOTOS and networks of automata, Formal Aspects of Computing, 22:6, (681-711), Online publication date: 1-Nov-2010.

Xing J, Theelen B, Langerak R, Van De Pol J, Tretmans J and Voeten J UPPAAL in practice Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II, (160-174)

Gröner G and Staab S Specialization and validation of statecharts in OWL Proceedings of the 17th international conference on Knowledge engineering and management by the masses, (360-370)

Mateescu R and Salaün G Translating Pi-calculus into LOTOS NT Proceedings of the 8th international conference on Integrated formal methods, (229-244)

Deng Y and Van Glabbeek R Characterising probabilistic processes logically Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning, (278-293)

Kathayat S From flow-global choreography to component types Proceedings of the 6th international conference on System analysis and modeling: about models, (36-55)

Esmaeilsabzali S, Day N and Atlee J A common framework for synchronization in requirements modelling languages Proceedings of the 13th international conference on Model driven engineering languages and systems: Part II, (198-212)

Krause C, Krause C and de Vink E Action-based analysis of discrete regulatory networks with short-term stimuli Proceedings of the 8th International Conference on Computational Methods in Systems Biology, (66-75)

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)

Grimsmo N, Bjørklund T and Hetland M Linear computation of the maximum simultaneous forward and backward bisimulation for node-labeled trees Proceedings of the 7th international XML database conference on Database and XML technologies, (18-32)

Mooij A, Parnjai J, Stahl C and Voorhoeve M Constructing replaceable services using operating guidelines and maximal controllers Proceedings of the 7th international conference on Web services and formal methods, (116-130)

Ballardin F and Merro M A calculus for the analysis of wireless network security protocols Proceedings of the 7th International conference on Formal aspects of security and trust, (206-222)

Lohmann N and Wolf K How to implement a theory of correctness in the area of business processes and services Proceedings of the 8th international conference on Business process management, (61-77)

Kanso B, Aiguier M, Boulanger F and Touil A Testing of abstract components Proceedings of the 7th International colloquium conference on Theoretical aspects of computing, (184-198)

Fu Y Theory by process Proceedings of the 21st international conference on Concurrency theory, (403-416)

Böhm S, Göller S and Jančar P Bisimilarity of one-counter processes is PSPACE-complete Proceedings of the 21st international conference on Concurrency theory, (177-191)

Eisentraut C, Hermanns H and Zhang L Concurrency and composition in a stochastic world Proceedings of the 21st international conference on Concurrency theory, (21-39)

You Z, Xue J and Ying S Categorial semantics of a solution to distributed dining philosophers problem Proceedings of the 4th international conference on Frontiers in algorithmics, (172-184)

Singh R, Giannakopoulou D and Păsăreanu C Learning component interfaces with may and must abstractions Proceedings of the 22nd international conference on Computer Aided Verification, (527-542)

Sewell P, Sarkar S, Owens S, Nardelli F and Myreen M (2010). x86-TSO, Communications of the ACM, 53:7, (89-97), Online publication date: 1-Jul-2010.

Wang H, Laurenson D and Hillston J (2010). A Reservation Optimised Advance Resource Reservation Scheme for Deploying RSVP in Mobile Environments, Wireless Personal Communications: An International Journal, 54:2, (251-275), Online publication date: 1-Jul-2010.

Eckardt T and Henkler S Component behavior synthesis for critical systems Proceedings of the First international conference on Architecting Critical Systems, (52-71)

Kindler E Model-based software engineering Proceedings of the Second International Workshop on Behaviour Modelling: Foundation and Applications, (1-8)

Wijs A Forgetting the time in timed process algebra Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems, (110-124)

Acciai L, Boreale M and Zavattaro G Behavioural contracts with request-response operations Proceedings of the 12th international conference on Coordination Models and Languages, (16-30)

Bozzelli L, Legay A and Pinchinat S Hardness of preorder checking for basic formalisms Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning, (119-135)

Girard A Synthesis using approximately bisimilar abstractions Proceedings of the 13th ACM international conference on Hybrid systems: computation and control, (111-120)

David A, Larsen K, Legay A, Nyman U and Wasowski A Timed I/O automata Proceedings of the 13th ACM international conference on Hybrid systems: computation and control, (91-100)

Kerber F and van der Schaft A Compositional analysis for linear control systems Proceedings of the 13th ACM international conference on Hybrid systems: computation and control, (21-30)

Hamadou S and Mullins J (2010). Calibrating the power of schedulers for probabilistic polynomial-time calculus, Journal of Computer Security, 18:2, (265-316), Online publication date: 1-Apr-2010.

Hurnaus D and Prähofer H Programming assistance based on contracts and modular verification in the automation domain Proceedings of the 2010 ACM Symposium on Applied Computing, (2544-2551)

Collinson M, Monahan B and Pym D Semantics for structured systems modelling and simulation Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques, (1-8)

He J and Hoare T (2010). CSP is a retract of CCS, Theoretical Computer Science, 411:11-13, (1311-1337), Online publication date: 1-Mar-2010.

Fu Y and Lu H (2010). On the expressiveness of interaction, Theoretical Computer Science, 411:11-13, (1387-1451), Online publication date: 1-Mar-2010.

Collinson M and Pym D (2009). Algebra and logic for access control, Formal Aspects of Computing, 22:2, (83-104), Online publication date: 1-Mar-2010.

D'Errico L and Loreti M Property-preserving refinement of concurrent systems Proceedings of the 5th international conference on Trustworthly global computing, (222-236)

Bernardo M, De Nicola R and Loreti M Uniform labeled transition systems for nondeterministic, probabilistic, and stochastic processes Proceedings of the 5th international conference on Trustworthly global computing, (35-56)

Furia C, Mandrioli D, Morzenti A and Rossi M (2010). Modeling time in computing, ACM Computing Surveys, 42:2, (1-59), Online publication date: 1-Feb-2010.

Rensink A The edge of graph transformation Graph transformations and model-driven engineering, (6-32)

Romanel A and Priami C (2010). On the computational power of BlenX, Theoretical Computer Science, 411:2, (542-565), Online publication date: 1-Jan-2010.

Fröschle S, Jančar P, Lasota S and Sawa Z (2010). Non-interleaving bisimulation equivalences on Basic Parallel Processes, Information and Computation, 208:1, (42-62), Online publication date: 1-Jan-2010.

Kozyura V, Roth A and Wei W Local Enforceability and Inconsumable Messages in Choreography Models Proceedings of the 2009 Fourth South-East European Workshop on Formal Methods, (10-16)

Derrick J and Boiten E (2009). Relational Concurrent Refinement, Electronic Notes in Theoretical Computer Science (ENTCS), 259, (21-34), Online publication date: 1-Dec-2009.

Lescaylle A and Villanueva A (2009). The tccp Interpreter, Electronic Notes in Theoretical Computer Science (ENTCS), 258:1, (63-77), Online publication date: 1-Dec-2009.

Curcin V, Ghanem M and Guo Y (2009). Analysing scientific workflows with Computational Tree Logic, Cluster Computing, 12:4, (399-419), Online publication date: 1-Dec-2009.

Su L, Bowman H, Barnard P and Wyble B (2009). Process algebraic modelling of attentional capture and human electrophysiology in interactive systems, Formal Aspects of Computing, 21:6, Online publication date: 1-Dec-2009.

Merro M and Sibilio E A calculus of trustworthy ad hoc networks Proceedings of the 6th international conference on Formal Aspects in Security and Trust, (157-172)

David A, Larsen K, Legay A, Nyman U and Wasowski A Methodologies for specification of real-time systems using timed I/O automata Proceedings of the 8th international conference on Formal methods for components and objects, (290-310)

Kokash N, Krause C and De Vink E Verification of context-dependent channel-based service models Proceedings of the 8th international conference on Formal methods for components and objects, (21-40)

Bernardo M (2009). Uniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes, Electronic Notes in Theoretical Computer Science (ENTCS), 253:3, (3-23), Online publication date: 1-Nov-2009.

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.

van de Pol J and Timmer M State Space Reduction of Linear Processes Using Control Flow Reconstruction Automated Technology for Verification and Analysis, (54-68)

Potop-Butucaru D, de Simone R, Sorel Y and Talpin J Clock-driven distributed real-time implementation of endochronous synchronous programs Proceedings of the seventh ACM international conference on Embedded software, (147-156)

Roop P, Andalam S, von Hanxleden R, Yuan S and Traulsen C Tight WCRT analysis of synchronous C programs Proceedings of the 2009 international conference on Compilers, architecture, and synthesis for embedded systems, (205-214)

Carmona J, Cortadella J, Kishinevsky M and Taubin A (2009). Elastic circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 28:10, (1437-1455), Online publication date: 1-Oct-2009.

Collinson M and Pym D (2009). Algebra and logic for resource-based systems modelling, Mathematical Structures in Computer Science, 19:5, (959-1027), Online publication date: 1-Oct-2009.

Howells P and d’Inverno M (2008). A CSP model with flexible parallel termination semantics, Formal Aspects of Computing, 21:5, (421-449), Online publication date: 1-Oct-2009.

Popescu A Weak bisimilarity coalgebraically Proceedings of the 3rd international conference on Algebra and coalgebra in computer science, (157-172)

Zargayouna M, Balbo F and Haddad S Data driven language for agents secure interaction Proceedings of the Second international conference on Languages, Methodologies, and Development Tools for Multi-Agent Systems, (72-91)

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)

Borgström J, Bhargavan K and Gordon A A compositional theory for STM Haskell Proceedings of the 2nd ACM SIGPLAN symposium on Haskell, (69-80)

Oshevskaya E Open maps bisimulations for higher dimensional automata models Proceedings of the 17th international conference on Fundamentals of computation theory, (274-286)

Cenciarelli P, Gorla D and Salvo I Depletable channels Proceedings of the 17th international conference on Fundamentals of computation theory, (50-61)

Wehrheim H and Wonisch D (2009). Compositional CSP Traces Refinement Checking, Electronic Notes in Theoretical Computer Science (ENTCS), 250:2, (135-151), Online publication date: 1-Sep-2009.

Stahl C and Wolf K (2009). Deciding service composition and substitutability using extended operating guidelines, Data & Knowledge Engineering, 68:9, (819-833), Online publication date: 1-Sep-2009.

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)

Frisco P Conformon p systems and topology of information flow Proceedings of the 10th international conference on Membrane Computing, (30-53)

Bonchi F, Brogi A, Corfini S and Gadducci F (2009). A Net-based Approach to Web Services Publication and Replaceability, Fundamenta Informaticae, 94:3-4, (305-330), Online publication date: 1-Aug-2009.

Llana L and Núuñez M (2009). Testing Semantics for RTPA, Fundamenta Informaticae, 90:3, (305-335), Online publication date: 1-Aug-2009.

Bonchi F, Brogi A, Corfini S and Gadducci F (2009). A Net-based Approach to Web Services Publication and Replaceability, Fundamenta Informaticae, 94:3-4, (305-330), Online publication date: 1-Aug-2009.

Miller D (2009). Formalizing Operational Semantic Specifications in Logic, Electronic Notes in Theoretical Computer Science (ENTCS), 246, (147-165), Online publication date: 1-Aug-2009.

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)

Ross B and Imada J Evolving stochastic processes using feature tests and genetic programming Proceedings of the 11th Annual conference on Genetic and evolutionary computation, (1059-1066)

Bloom S and Ésik Z (2009). Axiomatizing rational power series over natural numbers, Information and Computation, 207:7, (793-811), Online publication date: 1-Jul-2009.

Hüttel H, Kobayashi N and Suto T (2009). Undecidable equivalences for basic parallel processes, Information and Computation, 207:7, (812-829), Online publication date: 1-Jul-2009.

Hennessy M and Gaur M (2009). Counting the Cost in the Picalculus (Extended Abstract), Electronic Notes in Theoretical Computer Science (ENTCS), 229:3, (117-129), Online publication date: 1-Jul-2009.

Godskesen J (2009). A Calculus for Mobile Ad-hoc Networks with Static Location Binding, Electronic Notes in Theoretical Computer Science (ENTCS), 242:1, (161-183), Online publication date: 1-Jul-2009.

Bonchi F, Gadducci F and Monreale G (2009). Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding), Electronic Notes in Theoretical Computer Science (ENTCS), 242:1, (73-98), Online publication date: 1-Jul-2009.

Bartoletti M, Degano P, Ferrari G and Zunino R (2009). Hard Life with Weak Binders, Electronic Notes in Theoretical Computer Science (ENTCS), 242:1, (49-72), Online publication date: 1-Jul-2009.

Amadio R (2009). On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS, Electronic Notes in Theoretical Computer Science (ENTCS), 242:1, (3-17), Online publication date: 1-Jul-2009.

Mezioud C and Kholladi M Dynamic architecture for solving optimization problems of operators of mobile telephony Proceedings of the Second international conference on Global Information Infrastructure Symposium, (265-268)

Valmari A Bisimilarity Minimization in O(m logn) Time Proceedings of the 30th International Conference on Applications and Theory of Petri Nets, (123-142)

Kundu S, Tatlock Z and Lerner S Proving optimizations correct using parameterized program equivalence Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation, (327-337)

Karaman S, Rasmussen S, Kingston D and Frazzoli E Specification and planning of UAV missions Proceedings of the 2009 conference on American Control Conference, (1442-1447)

Bravetti M and Zavattaro G (2009). On the expressive power of process interruption and compensation, Mathematical Structures in Computer Science, 19:3, (565-599), Online publication date: 1-Jun-2009.

Bravetti M and Zavattaro G (2009). A theory of contracts for strong service compliance, Mathematical Structures in Computer Science, 19:3, (601-638), Online publication date: 1-Jun-2009.

Haß L and Noll T (2009). Equational Abstractions for Reducing the State Space of Rewrite Theories, Electronic Notes in Theoretical Computer Science (ENTCS), 238:3, (139-154), Online publication date: 1-Jun-2009.

Nami M and Hassani F (2009). A comparative evaluation of the Z, CSP, RSL, and VDM languages, ACM SIGSOFT Software Engineering Notes, 34:3, (1-4), Online publication date: 30-May-2009.

Kundu S, Tatlock Z and Lerner S (2009). Proving optimizations correct using parameterized program equivalence, ACM SIGPLAN Notices, 44:6, (327-337), Online publication date: 28-May-2009.

Wang D, Venkataraman V, Wang Z, Qin W, Wang H, Bose M and Bhadra J Accelerating multi-party scheduling for transaction-level modeling Proceedings of the 19th ACM Great Lakes symposium on VLSI, (339-344)

Sangiorgi D (2009). On the origins of bisimulation and coinduction, ACM Transactions on Programming Languages and Systems, 31:4, (1-41), Online publication date: 1-May-2009.

Bravetti M and Zavattaro G Contract Compliance and Choreography Conformance in the Presence of Message Queues Web Services and Formal Methods, (37-54)

Bravetti M and Zavattaro G On the Expressive Power of Process Interruption and Compensation Web Services and Formal Methods, (1-18)

Ying M, Feng Y, Duan R and Ji Z (2009). An algebra of quantum processes, ACM Transactions on Computational Logic, 10:3, (1-36), Online publication date: 1-Apr-2009.

Gorrieri R, Martinelli F and Matteucci I (2009). Towards Information Flow Properties for Distributed Systems, Electronic Notes in Theoretical Computer Science (ENTCS), 236, (65-84), Online publication date: 1-Apr-2009.

Bonchi F, Gadducci F and Monreale G Reactive Systems, Barbed Semantics, and the Mobile Ambients Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures - Volume 5504, (272-287)

Aranda J, Valencia F and Versari C On the Expressive Power of Restriction and Priorities in CCS with Replication Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures - Volume 5504, (242-256)

Kwiatkowska M, Norman G, Parker D and Vigliotti M (2009). Probabilistic Mobile Ambients, Theoretical Computer Science, 410:12-13, (1272-1303), Online publication date: 20-Mar-2009.

Koehler C and Clarke D Decomposing port automata Proceedings of the 2009 ACM symposium on Applied Computing, (1369-1373)

Llana L and Núuñez M (2009). Testing Semantics for RTPA, Fundamenta Informaticae, 90:3, (305-335), Online publication date: 1-Mar-2009.

Zhou J and Zeng G (2009). A mechanism for grid service composition behavior specification and verification, Future Generation Computer Systems, 25:3, (378-383), Online publication date: 1-Mar-2009.

Boiten E and Derrick J Modelling Divergence in Relational Concurrent Refinement Proceedings of the 7th International Conference on Integrated Formal Methods, (183-199)

Salaün G and Bultan T Realizability of Choreographies Using Process Algebra Encodings Proceedings of the 7th International Conference on Integrated Formal Methods, (167-182)

Zhao L, Li Q, Liu X and Du N A modeling method based on CCS for workflow Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, (376-384)

Hierons R, Bogdanov K, Bowen J, Cleaveland R, Derrick J, Dick J, Gheorghe M, Harman M, Kapoor K, Krause P, Lüttgen G, Simons A, Vilkomir S, Woodward M and Zedan H (2009). Using formal specifications to support testing, ACM Computing Surveys, 41:2, (1-76), Online publication date: 1-Feb-2009.

Ulidowski I and Yuen S (2009). Generating priority rewrite systems for OSOS process languages, Information and Computation, 207:2, (120-145), Online publication date: 1-Feb-2009.

de Frutos Escrig D and Gregorio Rodríguez C (2009). (Bi)simulations up-to characterise process semantics, Information and Computation, 207:2, (146-170), Online publication date: 1-Feb-2009.

Merro M (2009). An Observational Theory for Mobile Ad Hoc Networks (full version), Information and Computation, 207:2, (194-208), Online publication date: 1-Feb-2009.

Boiten E, Derrick J and Schellhorn G (2009). Relational concurrent refinement part II: Internal operations and outputs, Formal Aspects of Computing, 21:1-2, (65-102), Online publication date: 1-Feb-2009.

Hashemian S and Mavaddat F (2008). A Logical Reasoning Approach to Automatic Composition of Stateless Components, Fundamenta Informaticae, 89:4, (539-577), Online publication date: 31-Jan-2009.

Bravetti M and Zavattaro G (2008). A Foundational Theory of Contracts for Multi-party Service Composition, Fundamenta Informaticae, 89:4, (451-478), Online publication date: 31-Jan-2009.

Meng S and Arbab F (2009). QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata, Fundamenta Informaticae, 95:1, (103-128), Online publication date: 1-Jan-2009.

Balicki K and Szpyrka M (2009). Formal Definition of XCCS Modelling Language, Fundamenta Informaticae, 93:1-3, (1-15), Online publication date: 1-Jan-2009.

Ndukwu U and Sanders J Reasoning about a distributed probabilistic system Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94, (37-44)

Klin B Structural operational semantics for weighted transition systems Semantics and algebraic specification, (121-139)

Meng S and Arbab F (2009). QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata, Fundamenta Informaticae, 95:1, (103-128), Online publication date: 1-Jan-2009.

Balicki K and Szpyrka M (2009). Formal Definition of XCCS Modelling Language, Fundamenta Informaticae, 93:1-3, (1-15), Online publication date: 1-Jan-2009.

Bezerra J and Hirata C (2009). A polyadic pi-calculus approach for the formal specification of UML-RT, Advances in Software Engineering, 2009, (1-16), Online publication date: 1-Jan-2009.

Aceto L, Fokkink W, Ingolfsdottir A and Luttik B (2009). A finite equational base for CCS with left merge and communication merge, ACM Transactions on Computational Logic, 10:1, (1-26), Online publication date: 1-Jan-2009.

Bonchi F, Gadducci F and König B (2009). Synthesising CCS bisimulation using graph rewriting, Information and Computation, 207:1, (14-40), Online publication date: 1-Jan-2009.

Xu X (2009). Expressing first-order π-calculus in higher-order calculus of communicating systems, Journal of Computer Science and Technology, 24:1, (122-137), Online publication date: 1-Jan-2009.

Ding J, Hillston J and Laurenson D (2009). Performance Modelling of Content Adaptation for a Personal Distributed Environment, Wireless Personal Communications: An International Journal, 48:1, (93-112), Online publication date: 1-Jan-2009.

Ben Lakhal N, Kobayashi T and Yokota H (2009). FENECIA, The VLDB Journal — The International Journal on Very Large Data Bases, 18:1, (1-56), Online publication date: 1-Jan-2009.

Khomenko V, Schaefer M and Vogler W (2008). Output-Determinacy and Asynchronous Circuit Synthesis, Fundamenta Informaticae, 88:4, (541-579), Online publication date: 31-Dec-2009.

Hashemian S and Mavaddat F (2008). A Logical Reasoning Approach to Automatic Composition of Stateless Components, Fundamenta Informaticae, 89:4, (539-577), Online publication date: 1-Dec-2008.

Bravetti M and Zavattaro G (2008). A Foundational Theory of Contracts for Multi-party Service Composition, Fundamenta Informaticae, 89:4, (451-478), Online publication date: 1-Dec-2008.

Khomenko V, Schaefer M and Vogler W (2008). Output-Determinacy and Asynchronous Circuit Synthesis, Fundamenta Informaticae, 88:4, (541-579), Online publication date: 1-Dec-2008.

Aceto L, Fokkink W and Ingolfsdottir A (2008). A Cancellation Theorem for BCCSP, Fundamenta Informaticae, 88:1-2, (1-21), Online publication date: 1-Dec-2008.

Zhang J and Zhu Z (2008). A Behavioural Pseudometric based on λ--Bisimilarity, Electronic Notes in Theoretical Computer Science (ENTCS), 220:3, (115-127), Online publication date: 1-Dec-2008.

Macià H, Valero V, Cuartero F and Ruiz M (2008). sPBC: A Markovian Extension of Petri Box Calculus with Immediate Multiactions, Fundamenta Informaticae, 87:3-4, (367-406), Online publication date: 30-Nov-2008.

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: 30-Nov-2008.

Bhattacharyya A and Fitzgerald J Development of a formalism for modelling and analysis of dynamic reconfiguration of dependable real-time systems Proceedings of the 2008 RISE/EFTS Joint International Workshop on Software Engineering for Resilient Systems, (67-72)

Nejati S, Sabetzadeh M, Chechik M, Uchitel S and Zave P Towards compositional synthesis of evolving systems Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering, (285-296)

Kumar A and Shan Z Algorithms Based on Pattern Analysis for Verification and Adapter Creation for Business Process Composition Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:, (120-138)

Barbuti R, Maggiolo-Schettini A, Milazzo P and Tini S (2008). A P Systems Flat Form Preserving Step-by-step Behaviour, Fundamenta Informaticae, 87:1, (1-34), Online publication date: 1-Nov-2008.

Satoh I (2008). A Formal Approach for Milk-Run Transport Logistics, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E91-A:11, (3261-3268), Online publication date: 1-Nov-2008.

Aceto L, Capobianco S, Ingolfsdottir A and Luttik B (2008). The equational theory of prebisimilarity over basic CCS with divergence, Information Processing Letters, 108:5, (284-289), 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.

Gorrieri R, Martinelli F and Petrocchi M (2008). Formal Models and Analysis of Secure Multicast in Wired and Wireless Networks, Journal of Automated Reasoning, 41:3-4, (325-364), Online publication date: 1-Nov-2008.

Hennicker R, Janisch S and Knapp A Refinement of components in connection-safe assemblies with synchronous and asynchronous communication Proceedings of the 15th Monterey conference on Foundations of Computer Software: future Trends and Techniques for Development, (154-180)

Ben Hmida M and Haddad S Client synthesis for aspect oriented web services Proceedings of the 15th Monterey conference on Foundations of Computer Software: future Trends and Techniques for Development, (24-42)

Jančar P Selected Ideas Used for Decidability and Undecidability of Bisimilarity Proceedings of the 12th international conference on Developments in Language Theory, (56-71)

Nogueira S, Sampaio A and Mota A Guided Test Generation from CSP Models Proceedings of the 5th international colloquium on Theoretical Aspects of Computing, (258-273)

Li J, Zhu H and He J An Observational Model for Transactional Calculus of Services Orchestration Proceedings of the 5th international colloquium on Theoretical Aspects of Computing, (201-215)

Segala R The power of simulation relations Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, (462-462)

Mateescu R and Oudot E Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems Proceedings of the 15th international workshop on Model Checking Software, (196-213)

Macià H, Valero V, Cuartero F and Ruiz M (2008). sPBC: A Markovian Extension of Petri Box Calculus with Immediate Multiactions, Fundamenta Informaticae, 87:3-4, (367-406), Online publication date: 1-Aug-2008.

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 (2008). Embedding Event Algebras and Process for ECA Rules for the Semantic Web, Fundamenta Informaticae, 82:3, (237-263), Online publication date: 1-Aug-2008.

Pous D (2008). Using bisimulation proof techniques for the analysis of distributed abstract machines, Theoretical Computer Science, 402:2-3, (199-220), Online publication date: 20-Jul-2008.

Nanz S, Nielson F and Riis Nielson H Modal Abstractions of Concurrent Behaviour Proceedings of the 15th international symposium on Static Analysis, (159-173)

Behrends E, Fritzen O, May W and Schenk F (2008). Embedding Event Algebras and Process for ECA Rules for the Semantic Web, Fundamenta Informaticae, 82:3, (237-263), Online publication date: 15-Jul-2008.

Vladimerou V, Prabhakar P, Viswanathan M and Dullerud G STORMED Hybrid Systems Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II, (136-147)

Canetti R Composable Formal Security Analysis Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II, (1-13)

Gheorghiu Bobaru M, Păsăreanu C and Giannakopoulou D Automated Assume-Guarantee Reasoning by Abstraction Refinement Proceedings of the 20th international conference on Computer Aided Verification, (135-148)

Devillers R, Klaudel H and Koutny M (2008). A compositional Petri net translation of general π-calculus terms, Formal Aspects of Computing, 20:4-5, (429-450), Online publication date: 1-Jul-2008.

Barbuti R, Maggiolo-Schettini A, Milazzo P and Troina A (2008). Bisimulations in calculi modelling membranes, Formal Aspects of Computing, 20:4-5, (351-377), Online publication date: 1-Jul-2008.

Carmona J, Cortadella J, Kishinevsky M, Kondratyev A, Lavagno L and Yakovlev A A Symbolic Algorithm for the Synthesis of Bounded Petri Nets Proceedings of the 29th international conference on Applications and Theory of Petri Nets, (92-111)

Stranjak A, Čavrak I and Žagar M Scenario Description Language for Multi-agent Systems Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence, (855-864)

Prandi D, Quaglia P and Zannone N Formal analysis of BPMN via a translation into COWS Proceedings of the 10th international conference on Coordination models and languages, (249-263)

Zavattaro G A gentle introduction to stochastic (poly)automata collectives and the (bio)chemical ground form Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology, (507-523)

Versari C and Gorrieri R π@ Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology, (449-506)

Dematté L, Priami C and Romanel A The BlenX language Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology, (313-365)

Ciocchetta F and Hillston J Process algebras in systems biology Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology, (265-312)

Talcott C Pathway logic Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology, (21-53)

Dijkman R, Quartel D and van Sinderen M (2008). Consistency in multi-viewpoint design of enterprise information systems, Information and Software Technology, 50:7-8, (737-752), Online publication date: 1-Jun-2008.

Bergstra J and Middelburg C (2008). Distributed strategic interleaving with load balancing, Future Generation Computer Systems, 24:6, (530-548), Online publication date: 1-Jun-2008.

Chen H More on weak bisimilarity of normed basic parallel processes Proceedings of the 5th international conference on Theory and applications of models of computation, (192-203)

Cao Z Equivalence checking for a finite higher order π-calculus Proceedings of the 2nd international conference on Tests and proofs, (30-47)

Bergstra J and Middelburg C (2007). Maurer Computers with Single-Thread Control, Fundamenta Informaticae, 80:4, (333-362), Online publication date: 1-Apr-2008.

Cobleigh J, Avrunin G and Clarke L (2008). Breaking up is hard to do, ACM Transactions on Software Engineering and Methodology, 17:2, (1-52), Online publication date: 1-Apr-2008.

Bergstra J and Middelburg C (2008). Maurer computers for pipelined instruction processing†, Mathematical Structures in Computer Science, 18:2, (373-409), Online publication date: 1-Apr-2008.

Jin N, Shen C, Chen J and Ni T (2008). Engineering of An Assertion-based PSLSimple-Verilog Dynamic Verifier by Alternating Automata, Electronic Notes in Theoretical Computer Science (ENTCS), 207, (153-169), Online publication date: 1-Apr-2008.

Ribeiro P, Barbosa L and Wang S (2008). An Exercise on Transition Systems, Electronic Notes in Theoretical Computer Science (ENTCS), 207, (89-106), Online publication date: 1-Apr-2008.

Ciobanu G and Koutny M Modelling and verification of timed interaction and migration Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering, (215-229)

Hasuo I, Jacobs B and Sokolova A The microcosm principle and concurrency in coalgebra Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures, (246-260)

Kretinsky M, Rehak V and Strejcek J (2008). Petri nets are less expressive than state-extended PA, Theoretical Computer Science, 394:1-2, (134-140), Online publication date: 20-Mar-2008.

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)

Dematté L, Priami C and Romanel A (2008). Modelling and simulation of biological processes in BlenX, ACM SIGMETRICS Performance Evaluation Review, 35:4, (32-39), Online publication date: 1-Mar-2008.

Gilmore S and Hillston J (2008). Performance evaluation comes to life, ACM SIGMETRICS Performance Evaluation Review, 35:4, (3-13), Online publication date: 1-Mar-2008.

Bhaduri P and Ramesh S (2007). Interface synthesis and protocol conversion, Formal Aspects of Computing, 20:2, (205-224), Online publication date: 1-Mar-2008.

Gruska D (2007). Observation Based System Security, Fundamenta Informaticae, 79:3-4, (335-346), Online publication date: 1-Feb-2008.

Jančar P and Srba J (2008). Undecidability of bisimilarity by defender's forcing, Journal of the ACM, 55:1, (1-26), Online publication date: 1-Feb-2008.

Aceto L, Chen T, Fokkink W and Ingolfsdottir A (2008). On the axiomatisability of priority, Mathematical Structures in Computer Science, 18:1, (5-28), Online publication date: 1-Feb-2008.

Bernardo M and Botta S (2008). A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems, Mathematical Structures in Computer Science, 18:1, (29-55), Online publication date: 1-Feb-2008.

Jeffrey A and Rathke J (2008). Full abstraction for polymorphic π-calculus, Theoretical Computer Science, 390:2-3, (171-196), Online publication date: 20-Jan-2008.

Mastroeni I Deriving bisimulations by simplifying partitions Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation, (157-171)

Danos V, Feret J, Fontana W and Krivine J Abstract interpretation of cellular signalling networks Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation, (83-97)

Barbuti R, Maggiolo-Schettini A, Milazzo P and Tini S (2008). A P Systems Flat Form Preserving Step-by-step Behaviour, Fundamenta Informaticae, 87:1, (1-34), Online publication date: 1-Jan-2008.

Lopez N, Núñez M and Pelayo F A comparative study of STOPA and RTPA Transactions on computational science II, (224-245)

Tretmans J Model based testing with labelled transition systems Formal methods and testing, (1-38)

Sánchez C, Slanina M, Sipma H and Manna Z The reaction algebra Pillars of computer science, (596-619)

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)

Antonis K and Voros N (2008). System level design of telecom systems using formal model refinement, Journal of Systems Architecture: the EUROMICRO Journal, 54:1-2, (287-304), Online publication date: 1-Jan-2008.

Phillips I and Vigliotti M (2008). Symmetric electoral systems for ambient calculi, Information and Computation, 206:1, (34-72), Online publication date: 1-Jan-2008.

Huang X, Jiao L and Lu W What semantic equivalences are suitable for non-interference properties in computer security Proceedings of the 9th international conference on Information and communications security, (334-349)

Huang X, Jiao L and Lu W What Semantic Equivalences Are Suitable for Non-interference Properties in Computer Security Information and Communications Security, (334-349)

Bergstra J and Middelburg C (2007). Maurer Computers with Single-Thread Control, Fundamenta Informaticae, 80:4, (333-362), Online publication date: 1-Dec-2007.

Chirichiello A and Salaün G (2007). Encoding process algebraic descriptions of web services into BPEL, Web Intelligence and Agent Systems, 5:4, (419-434), Online publication date: 1-Dec-2007.

Vigliotti M, Phillips I and Palamidessi C (2007). Tutorial on separation results in process calculi via leader election problems, Theoretical Computer Science, 388:1-3, (267-289), Online publication date: 1-Dec-2007.

Schaefer M and Vogler W (2007). Component refinement and CSC-solving for STG decomposition, Theoretical Computer Science, 388:1-3, (243-266), Online publication date: 1-Dec-2007.

Aranda J, Di Giusto C, Nielsen M and Valencia F CCS with replication in the Chomsky hierarchy Proceedings of the 5th Asian conference on Programming languages and systems, (383-398)

Pous D Complete lattices and up-to techniques Proceedings of the 5th Asian conference on Programming languages and systems, (351-366)

Goubault-Larrecq J, Palamidessi C and Troina A A probabilistic applied pi-calculus Proceedings of the 5th Asian conference on Programming languages and systems, (175-190)

Aranda J, Di Giusto C, Nielsen M and Valencia F CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence Programming Languages and Systems, (383-398)

Pous D Complete Lattices and Up-To Techniques Programming Languages and Systems, (351-366)

Goubault-Larrecq J, Palamidessi C and Troina A A Probabilistic Applied Pi–Calculus Programming Languages and Systems, (175-190)

Vu T and Jesshope C Formalizing SANE virtual processor in thread algebra Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering, (345-365)

Fraikin B and Frappier M Efficient symbolic execution of large quantifications in a process algebra Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering, (327-344)

Vu T and Jesshope C Formalizing SANE Virtual Processor in Thread Algebra Formal Methods and Software Engineering, (345-365)

Fraikin B and Frappier M Efficient Symbolic Execution of Large Quantifications in a Process Algebra Formal Methods and Software Engineering, (327-344)

Schätz B and Giese H Models of reactive systems Proceedings of the 2007 International Dagstuhl conference on Model-based engineering of embedded real-time systems, (3-15)

Castellani I (2007). State-oriented Noninterference for CCS, Electronic Notes in Theoretical Computer Science (ENTCS), 194:1, (39-60), Online publication date: 1-Nov-2007.

Bergstra J and Middelburg C (2007). Thread algebra for strategic interleaving, Formal Aspects of Computing, 19:4, (445-474), Online publication date: 1-Nov-2007.

Zhu Z and Zhong F Testing equivalence for asymmetric χ-calculus Proceedings of the IASTED Asian Conference on Modelling and Simulation, (1-6)

Deussen P Model based reactive planning and prediction for autonomic systems Proceedings of the 2007 Workshop on INnovative SERvice Technologies, (1-10)

Nain S and Vardi M Branching vs. linear time Proceedings of the 5th international conference on Automated technology for verification and analysis, (19-34)

Nain S and Vardi M Branching vs. Linear Time: Semantical Perspective Automated Technology for Verification and Analysis, (19-34)

Larsen K, Nyman U and Wasowski A (2007). Modeling software product lines using color-blind transition systems, International Journal on Software Tools for Technology Transfer (STTT), 9:5-6, (471-487), Online publication date: 1-Oct-2007.

Honda K and Yoshida N (2007). A uniform type structure for secure information flow, ACM Transactions on Programming Languages and Systems, 29:6, (31-es), Online publication date: 1-Oct-2007.

Sumii E and Pierce B (2007). A bisimulation for type abstraction and recursion, Journal of the ACM, 54:5, (26-es), Online publication date: 1-Oct-2007.

Kiehn A (2007). An Operational Semantics for Shared Messaging Communication, Electronic Notes in Theoretical Computer Science (ENTCS), 192:1, (77-92), Online publication date: 1-Oct-2007.

de Frutos Escrig D and Rodríguez C (2007). Simulations Up-to and Canonical Preorders, Electronic Notes in Theoretical Computer Science (ENTCS), 192:1, (13-28), Online publication date: 1-Oct-2007.

Leppänen K, Leppänen S and Turunen M A modelling method for rigorous and automated design of large-scale industrial systems Proceedings of the 10th international conference on Model Driven Engineering Languages and Systems, (331-345)

Bliudze S and Sifakis J The algebra of connectors Proceedings of the 7th ACM & IEEE international conference on Embedded software, (11-20)

Liu X and Chen H Deciding weak bisimilarity of normed context-free processes using tableau Proceedings of the 4th international conference on Theoretical aspects of computing, (337-350)

Fábregas I, Palomino M and De Frutos Escrig D Reflection and preservation of properties in coalgebraic (bi)simulations Proceedings of the 4th international conference on Theoretical aspects of computing, (231-245)

Ma W, Tran D and Sharma D Using Tuple Space to Coordinate Multiagent Activities Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference, (589-596)

Hughes A A framework for mobile Java applications Proceedings of the 5th international symposium on Principles and practice of programming in Java, (243-248)

Mendler M and Lüttgen G Is observational congruence axiomatisable in equational horn logic? Proceedings of the 18th international conference on Concurrency Theory, (197-211)

Chen T, Ploeger B, van de Pol J and Willemse T Equivalence checking for infinite systems using parameterized Boolean equation systems Proceedings of the 18th international conference on Concurrency Theory, (120-135)

Aceto L and Ingolfsdottir A The saga of the axiomatization of parallel composition Proceedings of the 18th international conference on Concurrency Theory, (2-16)

Brodo L, Degano P and Priami C A stochastic semantics for bioambients Proceedings of the 9th international conference on Parallel Computing Technologies, (22-34)

Di Penta M, Santone A and Villani M Discovery of SOA patterns via model checking 2nd international workshop on Service oriented software engineering: in conjunction with the 6th ESEC/FSE joint meeting, (8-14)

Barbosa L, Cunha J and Visser J A type-level approach to component prototyping International workshop on Synthesis and analysis of component connectors: in conjunction with the 6th ESEC/FSE joint meeting, (23-36)

Izadi M and Movaghar A Compositional failure-based semantic equivalences for Reo specifications Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, (99-100)

Cleaveland R, Lüttgen G and Natarajan V (2007). Priority and abstraction in process algebra, Information and Computation, 205:9, (1426-1458), Online publication date: 1-Sep-2007.

Amadio R (2007). A synchronous π-calculus, Information and Computation, 205:9, (1470-1490), Online publication date: 1-Sep-2007.

Antonis K and Voros N Applying formal methods for the design of wireless telecommunication systems Proceedings of the 3rd international conference on Mobile multimedia communications, (1-6)

Aceto L, Ingólfsdóttir A and Mousavi M Impossibility results for the equational theory of timed CCS Proceedings of the 2nd international conference on Algebra and coalgebra in computer science, (80-95)

Aceto L, Fokkink W and Ingólfsdóttir A Ready to preorder Proceedings of the 2nd international conference on Algebra and coalgebra in computer science, (65-79)

Ranganath V, Amtoft T, Banerjee A, Hatcliff J and Dwyer M (2007). A new foundation for control dependence and slicing for modern program structures, ACM Transactions on Programming Languages and Systems, 29:5, (27-es), Online publication date: 2-Aug-2007.

Gruska D (2007). Observation Based System Security, Fundamenta Informaticae, 79:3-4, (335-346), Online publication date: 1-Aug-2007.

Zheng G, Li S, Wu J and Li L A non-interleaving denotational semantics of value passing CCS with action refinement Proceedings of the 1st annual international conference on Frontiers in algorithmics, (178-190)

Bossi A, Piazza C and Rossi S (2007). Compositional information flow security for concurrent programs, Journal of Computer Security, 15:3, (373-416), Online publication date: 1-Aug-2007.

Tse T, Lau F, Chan W, Liu P and Luk C (2007). Testing object-oriented industrial software without precise oracles or results, Communications of the ACM, 50:8, (78-85), Online publication date: 1-Aug-2007.

Kang E and Merz S (2007). Predicate diagrams for the verification of real-time systems, Formal Aspects of Computing, 19:3, (401-413), Online publication date: 1-Aug-2007.

Canal C, Murillo J and Poizat P Practical approaches for software adaptation Proceedings of the 2007 conference on Object-oriented technology, (154-165)

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)

Benton N, Kennedy A, Beringer L and Hofmann M Relational semantics for effect-based program transformations with dynamic allocation Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming, (87-96)

Lüttgen G and Vogler W Ready simulation for concurrency Proceedings of the 34th international conference on Automata, Languages and Programming, (752-763)

Kobayashi N and Suto T Undecidability of 2-label BPP equivalences and behavioral type systems for the π-calculus Proceedings of the 34th international conference on Automata, Languages and Programming, (740-751)

Bolton C Capturing conflict and confusion in CSP Proceedings of the 6th international conference on Integrated formal methods, (413-438)

Basu S and Smolka S (2007). Model checking the Java metalocking algorithm, ACM Transactions on Software Engineering and Methodology, 16:3, (12-es), Online publication date: 1-Jul-2007.

Lee H, Lee W, Chae H and Kwon Y (2007). Specification and analysis of timing requirements for real-time systems in the CBD approach, Real-Time Systems, 36:1-2, (135-158), Online publication date: 1-Jul-2007.

Westergaard M, Kristensen L, Brodal G and Arge L The ComBack method Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency, (445-464)

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.

Cubo J, Salaün G, Cámara J, Canal C and Pimentel E Context-based adaptation of component behavioural interfaces Proceedings of the 9th international conference on Coordination models and languages, (305-323)

von der Beeck M (2007). Development of logical and technical architectures for automotive systems, Software and Systems Modeling (SoSyM), 6:2, (205-219), Online publication date: 1-Jun-2007.

Knottenbelt W and Bradley J Tackling large state spaces in performance modelling Proceedings of the 7th international conference on Formal methods for performance evaluation, (318-370)

Bernardo M A survey of Markovian behavioral equivalences Proceedings of the 7th international conference on Formal methods for performance evaluation, (180-219)

Clark A, Gilmore S, Hillston J and Tribastone M Stochastic process algebras Proceedings of the 7th international conference on Formal methods for performance evaluation, (132-179)

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)

Yang Q, Li M, Wang Q, Yang G, Zhai J, Li J, Hou L and Yang Y An algebraic approach for managing inconsistencies in software processes Proceedings of the 2007 international conference on Software process, (121-133)

Qiu Z, Zhao X, Cai C and Yang H Towards the theoretical foundation of choreography Proceedings of the 16th international conference on World Wide Web, (973-982)

Lee W, Kim H and Chae H Safety property analysis techniques for cooperating embedded systems using LTS Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems, (114-124)

Tini S (2007). Notes on Generative Probabilistic Bisimulation, Electronic Notes in Theoretical Computer Science (ENTCS), 175:1, (77-88), Online publication date: 1-May-2007.

Pilegaard H, Nielson F and Nielson H (2007). Active Evaluation Contexts for Reaction Semantics, Electronic Notes in Theoretical Computer Science (ENTCS), 175:1, (57-70), Online publication date: 1-May-2007.

Sharafi M, Aliee F and Movaghar A A review on specifying software architectures using extended automata-based models Proceedings of the 2007 international conference on Fundamentals of software engineering, (423-431)

Yi J and Zhang W Efficient state space reduction for automata by fair simulation Proceedings of the 2007 international conference on Fundamentals of software engineering, (380-387)

Sangiorgi D, Kobayashi N and Sumii E Logical bisimulations and functional languages Proceedings of the 2007 international conference on Fundamentals of software engineering, (364-379)

Hashemian S and Mavaddat F Automatic composition of stateless components Proceedings of the 2007 international conference on Fundamentals of software engineering, (175-190)

Fecher H and Grabe I Finite abstract models for deterministic transition systems Proceedings of the 2007 international conference on Fundamentals of software engineering, (1-16)

Guo H, Shin Y and Lee W Enhanced compositional safety analysis for distributed embedded systems using LTS equivalence Proceedings of the 6th Conference on WSEAS International Conference on Applied Computer Science - Volume 6, (115-120)

Larsen J, Wisniewski R and Izadi-Zamanabadi R Hybrid control and verification of a pulsed welding process Proceedings of the 10th international conference on Hybrid systems: computation and control, (357-370)

Girard A Approximately bisimilar finite abstractions of stable linear systems Proceedings of the 10th international conference on Hybrid systems: computation and control, (231-244)

Davoren J and Tabuada P On simulations and bisimulations of general flow systems Proceedings of the 10th international conference on Hybrid systems: computation and control, (145-158)

Merelli E and Young M (2007). Validating MAS simulation models with mutation, Multiagent and Grid Systems, 3:2, (225-243), Online publication date: 1-Apr-2007.

Baeten J, Corradini F and Grabmayer C (2007). A characterization of regular expressions under bisimulation, Journal of the ACM, 54:2, (6-es), Online publication date: 1-Apr-2007.

Tardieu O (2007). A deterministic logical semantics for pure Esterel, ACM Transactions on Programming Languages and Systems, 29:2, (8-es), Online publication date: 1-Apr-2007.

Wong P and Gibbons J A process-algebraic approach to workflow specification and refinement Proceedings of the 6th international conference on Software composition, (51-65)

Tivoli M, Fradet P, Girault A and Goessler G Adaptor synthesis for real-time components Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems, (185-200)

Zhang L, Hermanns H, Eisenbrand F and Jansen D Flow faster Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems, (155-169)

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)

Rathke J, Sassone V and Sobociński P Semantic barbs and biorthogonality Proceedings of the 10th international conference on Foundations of software science and computational structures, (302-316)

Basin D, Olderog E and Sevinc P Specifying and analyzing security automata using CSP-OZ Proceedings of the 2nd ACM symposium on Information, computer and communications security, (70-81)

Tarasyuk I (2007). Stochastic Petri Box Calculus with Discrete Time, Fundamenta Informaticae, 76:1-2, (189-218), Online publication date: 1-Feb-2007.

Broy M, Krüger I and Meisinger M (2007). A formal model of services, ACM Transactions on Software Engineering and Methodology, 16:1, (5-es), Online publication date: 1-Feb-2007.

Osman N and Robertson D Dynamic verification of trust in distributed open systems Proceedings of the 20th international joint conference on Artifical intelligence, (1440-1445)

Tarasyuk I (2007). Stochastic Petri Box Calculus with Discrete Time, Fundamenta Informaticae, 76:1-2, (189-218), Online publication date: 1-Jan-2007.

Estevez E and Janowski T Programmable messaging for electronic government - building a foundation Formal methods and hybrid real-time systems, (217-236)

Jones C Understanding programming language concepts via operational semantics Domain modeling and the duration calculus, (177-235)

Milner R Elements of interaction ACM Turing award lectures

Rabinovich A (2007). On compositionality and its limitations, ACM Transactions on Computational Logic, 8:1, (4-es), Online publication date: 1-Jan-2007.

Guglielmi A (2007). A system of interaction and structure, ACM Transactions on Computational Logic, 8:1, (1-es), Online publication date: 1-Jan-2007.

Galmiche D and Larchey-Wendling D Expressivity properties of Boolean BI through relational models Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science, (357-368)

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)

Baldoni M, Baroglio C, Martelli A and Patti V A priori conformance verification for guaranteeing interoperability in open environments Proceedings of the 4th international conference on Service-Oriented Computing, (339-351)

Talcott C Symbolic modeling of signal transduction in pathway logic Proceedings of the 38th conference on Winter simulation, (1656-1665)

Busi N and Zandron C Modeling and analysis of biological processes by mem(brane) calculi and systems Proceedings of the 38th conference on Winter simulation, (1646-1655)

Noonan L and Flanagan C An effective network processor design framework Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems, (103-112)

Poddar R and Bhaduri P (2006). Verification of Giotto based embedded control systems, Nordic Journal of Computing, 13:4, (266-293), Online publication date: 1-Dec-2006.

Rajsbaum S (2006). ACM SIGACT news distributed computing column 24, ACM SIGACT News, 37:4, (58-84), Online publication date: 1-Dec-2006.

Pym D and Tofts C (2006). A Calculus and logic of resources and processes, Formal Aspects of Computing, 18:4, (495-517), Online publication date: 1-Dec-2006.

Bowman H and Gómez R (2006). How to stop time stopping, Formal Aspects of Computing, 18:4, (459-493), Online publication date: 1-Dec-2006.

Devillers R, Klaudel H and Koutny M A petri net translation of π-calculus terms Proceedings of the Third international conference on Theoretical Aspects of Computing, (138-152)

Aranda J, Di Giusto C, Palamidessi C and Valencia F On recursion, replication and scope mechanisms in process calculi Proceedings of the 5th international conference on Formal methods for components and objects, (185-206)

Omicini A, Ricci A and Viroli M (2006). Agent coordination contexts for the formal specification and enactment of coordination and security policies, Science of Computer Programming, 63:1, (88-107), Online publication date: 1-Nov-2006.

Aldini A (2006). Classification of security properties in a Linda-like process algebra, Science of Computer Programming, 63:1, (16-38), Online publication date: 1-Nov-2006.

Attiogbé J Multi-process systems analysis using event b Proceedings of the 8th international conference on Formal Methods and Software Engineering, (660-677)

Sadani T, Boyer M, de Saqui-Sannes P and Courtiat J Mapping RT-LOTOS specifications into time petri nets Proceedings of the 8th international conference on Formal Methods and Software Engineering, (360-379)

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)

Dong J, Liu Y, Sun J and Zhang X Verification of computation orchestration via timed automata Proceedings of the 8th international conference on Formal Methods and Software Engineering, (226-245)

Heckel R, Lajios G and Menge S (2006). Stochastic Graph Transformation Systems, Fundamenta Informaticae, 74:1, (63-84), Online publication date: 31-Oct-2006.

Wimmer R, Herbstritt M, Hermanns H, Strampp K and Becker B Sigref Proceedings of the 4th international conference on Automated Technology for Verification and Analysis, (477-492)

Miculan M and Bacci G Modal logics for brane calculus Proceedings of the 2006 international conference on Computational Methods in Systems Biology, (1-16)

von der Beeck M A formal semantics of UML-RT Proceedings of the 9th international conference on Model Driven Engineering Languages and Systems, (768-782)

Zhao X, Li L and Wu J Simulation for interactive markov chains Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I, (893-902)

Halpern J and Petride S A knowledge-based analysis of global function computation Proceedings of the 20th international conference on Distributed Computing, (136-150)

Edelkamp S, Jabbar S and Lafuente A Heuristic search for the analysis of graph transition systems Proceedings of the Third international conference on Graph Transformations, (414-429)

Bonchi F, Gadducci F and König B Process bisimulation via a graphical encoding Proceedings of the Third international conference on Graph Transformations, (168-183)

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)

Lambert D and Robertson D Selecting web services statistically Proceedings of the 10th international conference on Cooperative Information Agents, (153-167)

Canetti R (2006). Security and composition of cryptographic protocols, ACM SIGACT News, 37:3, (67-92), Online publication date: 1-Sep-2006.

Benatallah B, Casati F and Toumani F (2006). Representing, analysing and managing web service protocols, Data & Knowledge Engineering, 58:3, (327-357), Online publication date: 1-Sep-2006.

van Glabbeek R and Voorhoeve M Liveness, fairness and impossible futures Proceedings of the 17th international conference on Concurrency Theory, (126-141)

Kitchin D, Cook W and Misra J A language for task orchestration and its semantic properties Proceedings of the 17th international conference on Concurrency Theory, (477-491)

Chen T and Fokkink W On finite alphabets and infinite bases III Proceedings of the 17th international conference on Concurrency Theory, (421-434)

Andova S, Baeten J and Willemse T A complete axiomatisation of branching bisimulation for probabilistic systems with an application in protocol verification Proceedings of the 17th international conference on Concurrency Theory, (327-342)

Corradini F, Di Berardini M and Vogler W Checking a mutex algorithm in a process algebra with fairness Proceedings of the 17th international conference on Concurrency Theory, (142-157)

Van Der Meyden R and Zhang C A comparison of semantic models for noninterference Proceedings of the 4th international conference on Formal aspects in security and trust, (235-249)

Deng Y, Pang J and Wu P Measuring anonymity with relative entropy Proceedings of the 4th international conference on Formal aspects in security and trust, (65-79)

Boreale M and Gadducci F (2006). Processes as formal power series, Theoretical Computer Science, 360:1, (440-458), Online publication date: 21-Aug-2006.

Lüttgen G and Vogler W (2006). Bisimulation on speed, Theoretical Computer Science, 360:1, (209-227), Online publication date: 21-Aug-2006.

Miller D Representing and reasoning with operational semantics Proceedings of the Third international joint conference on Automated Reasoning, (4-20)

Kučera A and Schnoebelen P (2006). A general approach to comparing infinite-state systems with their finite-state specifications, Theoretical Computer Science, 358:2, (315-333), Online publication date: 7-Aug-2006.

Chen H, Yang Q and Xu M A calculus for MAS interaction protocol Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems, (22-33)

Sengupta B and Cleaveland R (2006). Triggered Message Sequence Charts, IEEE Transactions on Software Engineering, 32:8, (587-607), Online publication date: 1-Aug-2006.

Hyland M, Plotkin G and Power J (2006). Combining effects, Theoretical Computer Science, 357:1, (70-99), Online publication date: 25-Jul-2006.

Wang Y Cognitive informatics and contemporary mathematics for knowledge manipulation Proceedings of the First international conference on Rough Sets and Knowledge Technology, (69-78)

Aceto L, Fokkink W, Ingolfsdottir A and Luttik B A finite equational base for CCS with left merge and communication merge Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II, (492-503)

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)

Pavlovic D, Mislove M and Worrell J Testing semantics Proceedings of the 11th international conference on Algebraic Methodology and Software Technology, (308-322)

Chen Y and Sanders J Compositional reasoning for pointer structures Proceedings of the 8th international conference on Mathematics of Program Construction, (115-139)

Linden I, Jacquet J, De Bosschere K and Brogi A (2006). On the expressiveness of timed coordination models, Science of Computer Programming, 61:2, (152-187), Online publication date: 1-Jul-2006.

Kouchnarenko O and Lanoix A How to verify and exploit a refinement of component-based systems Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics, (297-309)

Gruska D Information-flow attacks based on limited observations Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics, (223-234)

Liu F, Shi Y, Zhang L, Lin L and Shi B Analysis of web services composition and substitution via CCS Proceedings of the Second international conference on Data Engineering Issues in E-Commerce and Services, (236-245)

Lafrance S (2006). Using equivalence-checking to verify robustness to denial of service, Computer Networks: The International Journal of Computer and Telecommunications Networking, 50:9, (1327-1348), Online publication date: 20-Jun-2006.

Sangiorgi D The bisimulation proof method Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems, (18-19)

Busi N, Gorrieri R, Guidi C, Lucchi R and Zavattaro G Choreography and orchestration conformance for system design Proceedings of the 8th international conference on Coordination Models and Languages, (63-81)

Bontà E, Bernardo M, Magee J and Kramer J Synthesizing concurrency control components from process algebraic specifications Proceedings of the 8th international conference on Coordination Models and Languages, (28-43)

Baier C and Wolf V Stochastic reasoning about channel-based component connectors Proceedings of the 8th international conference on Coordination Models and Languages, (1-15)

Engelhardtsen F and Prinz A Application of stuck-free conformance to service-role composition Proceedings of the 5th international conference on System Analysis and Modeling: language Profiles, (115-132)

Solanki M, Cau A and Zedan H ASDL Proceedings of the 15th international conference on World Wide Web, (687-696)

Roux-Rouquié M and da Rosa D Ten top reasons for systems biology to get into model-driven engineering Proceedings of the 2006 international workshop on Global integrated model management, (55-58)

Brunet G, Chechik M, Easterbrook S, Nejati S, Niu N and Sabetzadeh M A manifesto for model merging Proceedings of the 2006 international workshop on Global integrated model management, (5-12)

Cabodi G and Murciano M BDD-Based hardware verification Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems, (78-107)

Varacca D and Yoshida N (2006). Typed Event Structures and the π-Calculus, Electronic Notes in Theoretical Computer Science (ENTCS), 158, (373-397), Online publication date: 1-May-2006.

Mezzetti N and Sangiorgi D (2006). Towards a Calculus For Wireless Systems, Electronic Notes in Theoretical Computer Science (ENTCS), 158, (331-353), Online publication date: 1-May-2006.

Merro M and Biasi C (2006). On the Observational Theory of the CPS-calculus, Electronic Notes in Theoretical Computer Science (ENTCS), 158, (307-330), Online publication date: 1-May-2006.

Cámara J, Canal C, Cubo J and Vallecillo A (2006). Formalizing WSBPEL Business Processes Using Process Algebra, Electronic Notes in Theoretical Computer Science (ENTCS), 154:1, (159-173), Online publication date: 1-May-2006.

Groote J, Mousavi M and Reniers M (2006). A Hierarchy of SOS Rule Formats, Electronic Notes in Theoretical Computer Science (ENTCS), 156:1, (3-25), Online publication date: 1-May-2006.

Lanotte R, Maggiolo-Schettini A and Troina A (2006). A Classification of Time and/or Probability Dependent Security Properties, Electronic Notes in Theoretical Computer Science (ENTCS), 153:2, (177-193), Online publication date: 1-May-2006.

Deng Y, Chothia T, Palamidessi C and Pang J (2006). Metrics for Action-labelled Quantitative Transition Systems, Electronic Notes in Theoretical Computer Science (ENTCS), 153:2, (79-96), Online publication date: 1-May-2006.

Lawford M, Pantelic V and Zhang H (2006). Towards Integrated Verification of Timed Transition Models, Fundamenta Informaticae, 70:1,2, (75-110), Online publication date: 1-Apr-2006.

Lawford M, Pantelic V and Zhang H (2005). Towards integrated verification of timed transition models, Fundamenta Informaticae, 70:1, (75-110), Online publication date: 1-Apr-2006.

Círstea C (2006). A modular approach to defining and characterising notions of simulation, Information and Computation, 204:4, (469-502), Online publication date: 1-Apr-2006.

Kloetzer M and Belta C Reachability analysis of multi-affine systems Proceedings of the 9th international conference on Hybrid Systems: computation and control, (348-362)

Yang P, Basu S and Ramakrishnan C Parameterized verification of π-calculus systems Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems, (42-57)

Gorla D On the relative expressive power of asynchronous communication primitives Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures, (47-62)

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)

Chen T, Fokkink W and Nain S On finite alphabets and infinite bases II Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures, (1-15)

Datta A, Derek A, Mitchell J, Ramanathan A and Scedrov A Games and the impossibility of realizable ideal functionality Proceedings of the Third conference on Theory of Cryptography, (360-379)

Merro M and Hennessy M (2006). A bisimulation-based semantic theory of Safe Ambients, ACM Transactions on Programming Languages and Systems, 28:2, (290-330), Online publication date: 1-Mar-2006.

Meng S and Barbosa L (2006). Components as coalgebras, Theoretical Computer Science, 351:2, (276-294), Online publication date: 21-Feb-2006.

Křetínský M, Řehák V and Strejček J (2006). Refining the Undecidability Border of Weak Bisimilarity, Electronic Notes in Theoretical Computer Science (ENTCS), 149:1, (17-36), Online publication date: 1-Feb-2006.

Chen T, Han T and Lu J (2006). On the complete axiomatization for prefix iteration modulo observation congruence, Acta Cybernetica, 17:3, (471-483), Online publication date: 20-Jan-2006.

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)

Kobayashi N, Suenaga K and Wischik L Resource usage analysis for the π-calculus Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation, (298-312)

The SystemJ approach to system-level design Proceedings of the Fourth ACM/IEEE International Conference on Formal Methods and Models for Co-Design, (149-158)

Heckel R, Lajios G and Menge S (2006). Stochastic Graph Transformation Systems, Fundamenta Informaticae, 74:1, (63-84), Online publication date: 1-Jan-2006.

Fantechi A, Gnesi S and Semini L Achieving fault tolerance by a formally validated interaction policy Rigorous Development of Complex Fault-Tolerant Systems, (133-152)

Kang E and Merz S (2006). Predicate Diagrams for the Verification of Real-Time Systems, Electronic Notes in Theoretical Computer Science (ENTCS), 145, (151-165), 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)

Chen T, Han T and Lu J On the bisimulation congruence in χ-calculus Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science, (128-139)

Lü Y, Chen X, Fang L and Wang H Towards a symbolic bisimulation for the spi calculus Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks, (1095-1102)

Goble C, Gómez-Pérez A, González-Cabero R and Pérez-Hernández M ODEGSG framework, knowledge-based annotation and design of grid services Proceedings of the Third international conference on Service-Oriented Computing, (341-352)

Letichevsky A, Kapitonova J, Letichevsky A, Volkov V, Baranov S and Weigert T (2005). Basic protocols, message sequence charts, and the verification of requirements specifications, Computer Networks: The International Journal of Computer and Telecommunications Networking, 49:5, (661-675), Online publication date: 5-Dec-2005.

Damas C, Lambeau B, Dupont P and van Lamsweerde A (2005). Generating Annotated Behavior Models from End-User Scenarios, IEEE Transactions on Software Engineering, 31:12, (1056-1073), Online publication date: 1-Dec-2005.

Cassidy T, Cordy J, Dean T and Dingel J (2005). Source Transformation for Concurrency Analysis, Electronic Notes in Theoretical Computer Science (ENTCS), 141:4, (57-75), Online publication date: 1-Dec-2005.

Moschoyiannis S, Shields M and Krause P (2005). Modelling Component Behaviour with Concurrent Automata, Electronic Notes in Theoretical Computer Science (ENTCS), 141:3, (199-220), Online publication date: 1-Dec-2005.

Sinha R, Roop P and Khoussainov B (2005). Adaptive Verification using Forced Simulation, Electronic Notes in Theoretical Computer Science (ENTCS), 141:3, (171-197), Online publication date: 1-Dec-2005.

Wang Y, Wu C and Xu K Study on π-calculus based equipment grid service chain model Proceedings of the 2005 IFIP international conference on Network and Parallel Computing, (40-47)

Lang F Exp.Open 2.0 Proceedings of the 5th international conference on Integrated Formal Methods, (70-88)

Chaki S, Clarke E, Grumberg O, Ouaknine J, Sharygina N, Touili T and Veith H State/Event software verification for branching-time specifications Proceedings of the 5th international conference on Integrated Formal Methods, (53-69)

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)

Sengupta B and Cleaveland R An integrated framework for scenarios and state machines Proceedings of the 5th international conference on Integrated Formal Methods, (366-385)

Mantel H The framework of selective interleaving functions and the modular assembly kit Proceedings of the 2005 ACM workshop on Formal methods in security engineering, (53-62)

Merro M and Nardelli F (2005). Behavioral theory for mobile ambients, Journal of the ACM, 52:6, (961-1023), Online publication date: 1-Nov-2005.

Vigliotti M, Phillips I and Palamidessi C Separation results via leader election problems Proceedings of the 4th international conference on Formal Methods for Components and Objects, (172-194)

Sangiorgi D Beyond bisimulation Proceedings of the 4th international conference on Formal Methods for Components and Objects, (161-171)

Komenda J and van Schuppen J Control of modular and distributed discrete-event systems Proceedings of the 4th international conference on Formal Methods for Components and Objects, (44-63)

Wen Y, Wang J and Qi Z 2/3 alternating simulation between interface automata Proceedings of the 7th international conference on Formal Methods and Software Engineering, (173-187)

Lin S, Hsiung P, Huang C and Chen Y Model checking prioritized timed automata Proceedings of the Third international conference on Automated Technology for Verification and Analysis, (370-384)

Kelso J and Milne G Properties as processes Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems, (503-517)

Zhan N and Majster-Cederbaum M Deriving non-determinism from conjunction and disjunction Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems, (351-365)

Ciaffaglione A, Hennessy M and Rathke J Proof methodologies for behavioural equivalence in DPI Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems, (335-350)

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)

Corradini F and Vogler W Performance of pipelined asynchronous systems Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems, (242-257)

Gu Y, Fu Y, Zhong F and Zhu H A generic model for analyzing security protocols Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security, (119-128)

Giacobazzi R and Mastroeni I Generalized abstract non-interference Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security, (221-234)

Yamasaki S and Sasakura M A calculus effectively performing event formation with visualization Proceedings of the 6th international symposium on high-performance computing and 1st international conference on Advanced low power systems, (287-294)

Anantharaman S, Chen J and Hains G A Synchronous Process Calculus for Service Costs Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods, (435-444)

Jin N and He J Towards A Truly Concurrent Model for Processes Sharing Resources Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods, (231-239)

Sadani T, De Saqui-Sannes P and Courtiat J From RT-LOTOS to Time Petri Nets New Foundations for a Verification Platform Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods, (250-260)

Letier E, Kramer J, Magee J and Uchitel S Fluent temporal logic for discrete-time event-based models Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering, (70-79)

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)

Puhlmann F and Weske M Using the π-calculus for formalizing workflow patterns Proceedings of the 3rd international conference on Business Process Management, (153-168)

Andreeva M and Virbitskaite I Timed equivalences for timed event structures Proceedings of the 8th international conference on Parallel Computing Technologies, (16-26)

Aceto L, Fokkink W, Ingolfsdottir A and Nain S Bisimilarity is not finitely based over BPA with interrupt Proceedings of the First international conference on Algebra and Coalgebra in Computer Science, (52-66)

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)

Klin B The least fibred lifting and the expressivity of coalgebraic modal logic Proceedings of the First international conference on Algebra and Coalgebra in Computer Science, (247-262)

Letier E, Kramer J, Magee J and Uchitel S (2005). Fluent temporal logic for discrete-time event-based models, ACM SIGSOFT Software Engineering Notes, 30:5, (70-79), Online publication date: 1-Sep-2005.

Norton B, Foster S and Hughes A A compositional operational semantics for OWL-S Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes, (303-317)

Greenfield P, Kuo D, Nepal S and Fekete A Consistency for web services applications Proceedings of the 31st international conference on Very large data bases, (1199-1203)

Escrig D and Rodríguez C Bisimulations up-to for the linear time branching time spectrum CONCUR 2005 - Concurrency Theory, (278-292)

Baeten J and Bravetti M A ground-complete axiomatization of finite state processes in process algebra CONCUR 2005 - Concurrency Theory, (248-262)

van Breugel F A behavioural pseudometric for metric labelled transition systems CONCUR 2005 - Concurrency Theory, (141-155)

D'Argenio P and Gebremichael B The coarsest congruence for timed automata with deadlines contained in bisimulation CONCUR 2005 - Concurrency Theory, (125-140)

Viroli M and Omicini A (2005). Process-algebraic approaches for multi-agent systems, Applicable Algebra in Engineering, Communication and Computing, 16:2-3, (69-75), Online publication date: 1-Aug-2005.

Pinto M, Foss L, Mombach J and Ribeiro L Modeling and property verification of lactose operon regulation Proceedings of the 2005 Brazilian conference on Advances in Bioinformatics and Computational Biology, (95-106)

Lambert D and Robertson D Matchmaking multi-party interactions using historical performance data Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, (611-617)

Keil D and Goldin D Indirect interaction in environments for multi-agent systems Proceedings of the 2nd international conference on Environments for Multi-Agent Systems, (68-87)

Alferes J and May W Evolution and reactivity for the web Proceedings of the First international conference on Reasoning Web, (134-172)

Bolton C Adding conflict and confusion to CSP Proceedings of the 2005 international conference on Formal Methods, (205-220)

Fokkink W and Nain S A finite basis for failure semantics Proceedings of the 32nd international conference on Automata, Languages and Programming, (755-765)

Martinelli F Towards an integrated formal analysis for security and trust Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems, (115-130)

Cattani G and Winskel G (2005). Profunctors, open maps and bisimulation, Mathematical Structures in Computer Science, 15:3, (553-614), Online publication date: 1-Jun-2005.

Mao W (2005). A structured operational semantic modelling of the Dolev-Yao threat environment and its composition with cryptographic protocols, Computer Standards & Interfaces, 27:5, (479-488), Online publication date: 1-Jun-2005.

Palamidessi C and Herescu O (2005). A randomized encoding of the π-calculus with mixed choice, Theoretical Computer Science, 335:2-3, (373-404), Online publication date: 23-May-2005.

Luttik B and van Oostrom V (2005). Decomposition orders, Theoretical Computer Science, 335:2-3, (147-186), Online publication date: 23-May-2005.

Aldini A and Bernardo M (2005). On the usability of process algebra, Theoretical Computer Science, 335:2-3, (281-329), Online publication date: 23-May-2005.

Baeten J (2005). A brief history of process algebra, Theoretical Computer Science, 335:2-3, (131-146), Online publication date: 23-May-2005.

Corradini F and Vogler W (2005). Measuring the performance of asynchronous systems with PAFAS, Theoretical Computer Science, 335:2-3, (187-213), Online publication date: 23-May-2005.

Bossi A, Macedonio D, Piazza C and Rossi S (2005). Information flow in secure contexts, Journal of Computer Security, 13:3, (391-422), Online publication date: 1-May-2005.

Tardieu O (2005). A Deterministic Logical Semantics for Esterel, Electronic Notes in Theoretical Computer Science (ENTCS), 128:1, (103-122), Online publication date: 1-May-2005.

Acquaviva A, Aldini A, Bernardo M, Bogliolo A, Bontà E and Lattanzi E A methodology based on formal methods for predicting the impact of dynamic power management Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing, (155-189)

Grassi V Performance analysis of mobile systems Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing, (107-154)

Bettini L and De Nicola R Mobile distributed programming in X-KLAIM Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing, (29-68)

Montanari U and Pistore M History-dependent automata Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing, (1-28)

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)

Bernardo M and Bontà E Preserving architectural properties in multithreaded code generation Proceedings of the 7th international conference on Coordination Models and Languages, (188-203)

Joubert C and Mateescu R (2005). Distributed On-the-Fly Equivalence Checking, Electronic Notes in Theoretical Computer Science (ENTCS), 128:3, (47-62), Online publication date: 19-Apr-2005.

Zhao L, Jarvis S, Spooner D and Nudd G Predictive Performance Modelling of Parallel Component Composition Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16

Ranganath V, Amtoft T, Banerjee A, Dwyer M and Hatcliff J A new foundation for control-dependence and slicing for modern program structures Proceedings of the 14th European conference on Programming Languages and Systems, (77-93)

Larsen K, Larsen U and Wasowski A Color-Blind specifications for transformations of reactive synchronous programs Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering, (160-174)

Goldblatt R (2005). A comonadic account of behavioural covarieties of coalgebras, Mathematical Structures in Computer Science, 15:2, (243-269), Online publication date: 1-Apr-2005.

Leucker M, Noll T, Stevens P and Weber M (2005). Functional programming languages for verification tools, International Journal on Software Tools for Technology Transfer (STTT), 7:2, (184-194), Online publication date: 1-Apr-2005.

Miller R, Chen D, Lee D and Hao R Coping with nondeterminism in network protocol testing Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems, (129-145)

Strubbe S and van der Schaft A Bisimulation for communicating piecewise deterministic markov processes (CPDPs) Proceedings of the 8th international conference on Hybrid Systems: computation and control, (623-639)

van Breugel F, Mislove M, Ouaknine J and Worrell J (2005). Domain theory, testing and simulation for labelled Markov processes, Theoretical Computer Science, 333:1-2, (171-197), Online publication date: 1-Mar-2005.

Gössler G and Sifakis J (2005). Composition for component-based modeling, Science of Computer Programming, 55:1-3, (161-183), Online publication date: 1-Mar-2005.

Datta A, Küsters R, Mitchell J and Ramanathan A On the relationships between notions of simulation-based security Proceedings of the Second international conference on Theory of Cryptography, (476-494)

Gnesi S, Lenzini G and Martinelli F (2005). Logical Specification and Analysis of Fault Tolerant Systems Through Partial Model Checking, Electronic Notes in Theoretical Computer Science (ENTCS), 118:C, (57-70), Online publication date: 1-Feb-2005.

Šafránek D and Šimša J VCD Proceedings of the 31st international conference on Theory and Practice of Computer Science, (320-329)

Neubauer M and Thiemann P (2005). From sequential programs to multi-tier applications by program transformation, ACM SIGPLAN Notices, 40:1, (221-232), Online publication date: 12-Jan-2005.

Neubauer M and Thiemann P From sequential programs to multi-tier applications by program transformation Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (221-232)

Bergstra J and Middelburg C Model theory for process algebra Processes, Terms and Cycles, (445-495)

Aceto L, Fokkink W, Ingolfsdottir A and Luttik B Finite equational bases in process algebra Processes, Terms and Cycles, (338-367)

Deng Y, Palamidessi C and Pang J Compositional reasoning for probabilistic finite-state behaviors Processes, Terms and Cycles, (309-337)

Maydl W and Grunske L Behavioral types for embedded software Component-Based Software Development for Embedded Systems, (82-106)

Priami C and Quaglia P Operational patterns in beta-binders Transactions on Computational Systems Biology I, (50-65)

Cannata N, Corradini F, Merelli E, Omicini A and Ricci A An agent-oriented conceptual framework for systems biology Transactions on Computational Systems Biology III, (105-122)

Bouyssounouse B and Sifakis J Computing platforms Embedded Systems Design, (388-449)

Ribeiro L, Dotti F and Bardohl R A formal framework for the development of concurrent object-based systems Formal Methods in Software and Systems Modeling, (385-401)

Gadducci F and Montanari U Graph processes with fusions Formal Methods in Software and Systems Modeling, (84-100)

Bugliesi M and Rossi S (2005). Non-interference proof technique for the analysis of cryptographic protocols, Journal of Computer Security, 13:1, (87-113), Online publication date: 1-Jan-2005.

Bistarelli S, Cervesato I, Lenzini G and Martinelli F (2005). Relating multiset rewriting and process algebras for security protocol analysis, Journal of Computer Security, 13:1, (3-47), Online publication date: 1-Jan-2005.

Rocha R, Silva F and Costa V (2005). On applying or-parallelism and tabling to logic programs, Theory and Practice of Logic Programming, 5:1-2, (161-205), Online publication date: 1-Jan-2005.

Gradara S, Santone A, Villani M and Vaglini G (2004). Model Checking Multithreaded Programs by Means of Reduced Models, Electronic Notes in Theoretical Computer Science (ENTCS), 110:C, (55-74), Online publication date: 31-Dec-2005.

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)

Lee D, Liu C and Yannakakis M Protocol system integration, interface and interoperability Proceedings of the 8th international conference on Principles of Distributed Systems, (1-19)

Ferrara A Web services Proceedings of the 2nd international conference on Service oriented computing, (242-251)

Kroening D and Clarke E Checking consistency of C and Verilog using predicate abstraction and induction Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design, (66-72)

Barbosa L A perspective on component refinement Proceedings of the Third international conference on Formal Methods for Components and Objects, (23-48)

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)

Rajamani S and Rehof J Models for contract conformance Proceedings of the First international conference on Leveraging Applications of Formal Methods, (181-196)

Hess K, Parent P, Tonks A and Worytkiewicz K (2004). Simulations as Homotopies, Electronic Notes in Theoretical Computer Science (ENTCS), 100:C, (65-93), Online publication date: 28-Oct-2004.

Dwyer M, Clarke L, Cobleigh J and Naumovich G (2004). Flow analysis for verifying properties of concurrent software systems, ACM Transactions on Software Engineering and Methodology, 13:4, (359-430), Online publication date: 1-Oct-2004.

Henderson P, Walters R and Crouch S Implementing Hierarchical Features in a Graphically Based Formal Modelling Language Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01, (92-98)

Bordbar B and Okano K Testing deadlock-freeness in real-time systems Proceedings of the 4th international conference on Formal Approaches to Software Testing, (95-109)

de Frutos Escrig D and Rodróguez C Preserving contexts for soft conformance relation Proceedings of the 4th international conference on Formal Approaches to Software Testing, (33-48)

Lu Y, Atlee J, Day N and Niu J Mapping Template Semantics to SMV Proceedings of the 19th IEEE international conference on Automated software engineering, (320-325)

Zenmyo T, Kobayashi T and Saeki M Automated Support for Framework Selection and Customization Proceedings of the 19th IEEE international conference on Automated software engineering, (68-77)

Korade N and Arun-Kumar S A logical characterization of efficiency preorders Proceedings of the First international conference on Theoretical Aspects of Computing, (99-112)

Niaouris A An algebra of petri nets with arc-based time restrictions Proceedings of the First international conference on Theoretical Aspects of Computing, (447-462)

Wen Y, Wang J and Qi Z Reverse observation equivalence between labelled state transition systems Proceedings of the First international conference on Theoretical Aspects of Computing, (204-219)

Reeves S and Streader D Atomic components Proceedings of the First international conference on Theoretical Aspects of Computing, (128-139)

Honda K From process logic to program logic Proceedings of the ninth ACM SIGPLAN international conference on Functional programming, (163-174)

Honda K (2004). From process logic to program logic, ACM SIGPLAN Notices, 39:9, (163-174), Online publication date: 19-Sep-2004.

Koshkina M and van Breugel F (2004). Modelling and verifying web service orchestration by means of the concurrency workbench, ACM SIGSOFT Software Engineering Notes, 29:5, (1-10), Online publication date: 1-Sep-2004.

Kristensen L and Christensen S (2004). Implementing Coloured Petri Nets Using a Functional Programming Language, Higher-Order and Symbolic Computation, 17:3, (207-243), 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)

Janin D and Lenzi G (2004). 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.

Huth M, Jagadeesan R and Schmidt D (2004). A domain equation for refinement of partial systems, Mathematical Structures in Computer Science, 14:4, (469-505), 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.

Aldini A and Di Pierro A (2004). A Quantitative Approach to Noninterference for Probabilistic Systems, Electronic Notes in Theoretical Computer Science (ENTCS), 99, (155-182), 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.

Gnesi S, Lenzini G and Martinelli F (2004). Applying Generalized Non Deducibility on Compositions (GNDC) Approach in Dependability, Electronic Notes in Theoretical Computer Science (ENTCS), 99, (111-126), Online publication date: 1-Aug-2004.

Viroli M and Ricci A Instructions-Based Semantics of Agent Mediated Interaction Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1, (102-109)

Ricci A, Viroli M and Omicini A Environment-based coordination through coordination artifacts Proceedings of the First international conference on Environments for Multi-Agent Systems, (190-214)

Viroli M and Ricci A Agent interaction semantics by timed operating instructions Proceedings of the 2004 international conference on Agent Communication, (173-192)

Pokorny L and Ramakrishnan C Modeling and verification of distributed autonomous agents using logic programming Proceedings of the Second international conference on Declarative Agent Languages and Technologies, (148-165)

Jifeng H Linking theories of concurrency Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years, (61-74)

Hoare T Process algebra Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years, (36-60)

Brookes S Retracing the semantics of CSP Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years, (1-14)

Yang P, Ramakrishnan C and Smolka S (2004). A logical encoding of the ź-calculus, International Journal on Software Tools for Technology Transfer (STTT), 6:1, (38-66), Online publication date: 1-Jul-2004.

Chiu D, Cheung S, Till S, Karlapalem K, Li Q and Kafeza E (2004). Workflow View Driven Cross-Organizational Interoperability in a Web Service Environment, Information Technology and Management, 5:3-4, (221-250), Online publication date: 1-Jul-2004.

D'Inverno M, Luck M, Georgeff M, Kinny D and Wooldridge M (2004). The dMARS Architecture, Autonomous Agents and Multi-Agent Systems, 9:1-2, (5-53), Online publication date: 1-Jul-2004.

Fan W, Chan C and Garofalakis M Secure XML querying with security views Proceedings of the 2004 ACM SIGMOD international conference on Management of data, (587-598)

Flatt M and Findler R (2004). Kill-safe synchronization abstractions, ACM SIGPLAN Notices, 39:6, (47-58), Online publication date: 9-Jun-2004.

Flatt M and Findler R Kill-safe synchronization abstractions Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation, (47-58)

Marculescu R, Ogras U and Zamora N Computation and communication refinement for multiprocessor SoC design Proceedings of the 41st annual Design Automation Conference, (564-592)

Petride S (2004). Review of "Concurrent and real-time systems, ACM SIGACT News, 35:2, (4-12), Online publication date: 1-Jun-2004.

Chaki S, Clarke E, Groce A, Jha S and Veith H (2004). Modular Verification of Software Components in C, IEEE Transactions on Software Engineering, 30:6, (388-402), Online publication date: 1-Jun-2004.

Priami C and Quaglia P Beta binders for biological interactions Proceedings of the 20 international conference on Computational Methods in Systems Biology, (20-33)

Feng Y and Ying M (2004). Process algebra approach to reasoning about concurrent actions, Journal of Computer Science and Technology, 19:3, (364-373), Online publication date: 1-May-2004.

Duan Z and Koutny M (2004). A framed temporal logic programming language, Journal of Computer Science and Technology, 19:3, (341-351), Online publication date: 1-May-2004.

Tabuada P, Pappas G and Lima P (2004). Compositional Abstractions of Hybrid Control Systems, Discrete Event Dynamic Systems, 14:2, (203-238), Online publication date: 1-Apr-2004.

Borgström J, Nestmann U, Onana L and Gurov D Verifying a Structured Peer-to-Peer Overlay Network IST/FET International Workshop on Global Computing - Volume 3267, (250-265)

Igarashi A and Kobayashi N (2004). A generic type system for the Pi-calculus, Theoretical Computer Science, 311:1-3, (121-163), Online publication date: 23-Jan-2004.

Balsamo S, Marzolla M, Di Marco A and Inverardi P Experimenting different software architectures performance techniques Proceedings of the 4th international workshop on Software and performance, (115-119)

Polkowski L and Semeniuk-Polkowska M (2004). Some Remarks on Sets of Communicating Sequential Processes in Topological Rough Set Framework, Fundamenta Informaticae, 60:1-4, (291-305), Online publication date: 1-Jan-2004.

Mosses P (2004). Exploiting Labels in Structural Operational Semantics, Fundamenta Informaticae, 60:1-4, (17-31), Online publication date: 1-Jan-2004.

Burton J, Koutny M and Pappalardo G (2004). Relating Communicating Processes with Different Interfaces, Fundamenta Informaticae, 59:1, (1-37), Online publication date: 1-Jan-2004.

Balsamo S, Marzolla M, Di Marco A and Inverardi P (2004). Experimenting different software architectures performance techniques, ACM SIGSOFT Software Engineering Notes, 29:1, (115-119), Online publication date: 1-Jan-2004.

Automated, compositional and iterative deadlock detection Proceedings of the Second ACM/IEEE International Conference on Formal Methods and Models for Co-Design, (201-210)

Wong K and Wonham W (2004). On the Computation of Observers in Discrete-Event Systems, Discrete Event Dynamic Systems, 14:1, (55-107), Online publication date: 1-Jan-2004.

Bergstra J, Ponse A and van der Zwaag M (2003). Branching time and orthogonal bisimulation equivalence, Theoretical Computer Science, 309:1, (313-355), Online publication date: 2-Dec-2003.

Straßburger L (2003). MELL in the calculus of structures, Theoretical Computer Science, 309:1, (213-285), Online publication date: 2-Dec-2003.

Gardiner P (2003). Power simulation and its relation to traces and failures refinement, Theoretical Computer Science, 309:1, (157-176), Online publication date: 2-Dec-2003.

Galpin V (2003). A format for semantic equivalence comparison, Theoretical Computer Science, 309:1, (65-109), Online publication date: 2-Dec-2003.

Janin D and Lenzi G (2003). 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.

Newman R and Gaura E Formal design of SMIL presentations Proceedings of the 21st annual international conference on Documentation, (113-116)

Tkachuk O, Dwyer M and Pasareanu C Automated environment generation for software model checking Proceedings of the 18th IEEE International Conference on Automated Software Engineering, (116-127)

Polkowski L and Semeniuk-Polkowska M (2003). Some Remarks on Sets of Communicating Sequential Processes in Topological Rough Set Framework, Fundamenta Informaticae, 60:1-4, (291-305), Online publication date: 1-Sep-2003.

Mosses P (2003). Exploiting Labels in Structural Operational Semantics, Fundamenta Informaticae, 60:1-4, (17-31), Online publication date: 1-Sep-2003.

Desharnais J, Gupta V, Jagadeesan R and Panangaden P (2003). Approximating labelled Markov processes, Information and Computation, 184:1, (160-200), 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)

Floch J and Bræk R Using projections for the detection of anomalous behaviors Proceedings of the 11th international conference on System design, (251-268)

Givan R, Dean T and Greig M (2003). Equivalence notions and model minimization in Markov decision processes, Artificial Intelligence, 147:1-2, (163-223), Online publication date: 1-Jul-2003.

Mayr R Undecidability of weak bisimulation equivalence for 1-counter processes Proceedings of the 30th international conference on Automata, languages and programming, (570-583)

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)

Piccinelli G and Williams S Workflow Proceedings of the 2003 international conference on Business process management, (13-24)

Brinksma E Compositional theories of qualitative and quantitative behaviour Proceedings of the 24th international conference on Applications and theory of Petri nets, (37-42)

Tardieu O and De Simone R Instantaneous termination in pure Esterel Proceedings of the 10th international conference on Static analysis, (91-108)

Inverardi P, Tivoli M and Bucchiarone A Automatic synthesis of coordinators for COTS group-ware applications Proceedings of the Twelfth International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises

Moller F and Smolka S On the computational complexity of bisimulation, redux Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday, (55-59)

Frappier M and Laleau R Proving event ordering properties for information systems Proceedings of the 3rd international conference on Formal specification and development in Z and B, (421-436)

Burton J, Koutny M and Pappalardo G (2003). Relating communicating processes with different interfaces, Fundamenta Informaticae, 59:1, (1-37), Online publication date: 1-Jun-2003.

Mugridge R, MacDonald B and Roop P A customer test generator for web-based systems Proceedings of the 4th international conference on Extreme programming and agile processes in software engineering, (189-197)

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)

Spitznagel B and Garlan D A compositional formalization of connector wrappers Proceedings of the 25th International Conference on Software Engineering, (374-384)

Yeung W and Schneider S (2003). Design and Verification of Distributed Recovery Blocks with CSP, Formal Methods in System Design, 22:3, (225-248), Online publication date: 1-May-2003.

Busi N and Zavattaro G (2003). Expired data collection in shared dataspaces, Theoretical Computer Science, 298:3, (529-556), Online publication date: 11-Apr-2003.

Bigot C, Faivre A, Gallois J, Lapitre A, Lugato D, Pierron J and Rapin N Automatic test generation with AGATHA Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems, (591-596)

Basu S and Ramakrishnan C Compositional analysis for verification of parameterized systems Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems, (315-330)

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)

Gorrieri R, Locatelli E and Martinelli F A simple language for real-time cryptographic protocol analysis Proceedings of the 12th European conference on Programming, (114-128)

Hennessy M, Merro M and Rathke J Towards a behavioural theory of access and mobility control in distributed systems (extended abstract) Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software, (282-298)

van Breugel F, Mislove M, Ouaknine J and Worrell J An intrinsic characterization of approximate probabilistic bisimilarity Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software, (200-215)

Tabuada P and Pappas G Model checking LTL over controllable linear systems is decidable Proceedings of the 6th international conference on Hybrid systems: computation and control, (498-513)

Buchholz P and Kemper P (2003). Weak bisimulation for (max/+) automata and related models, Journal of Automata, Languages and Combinatorics, 8:2, (187-218), Online publication date: 1-Apr-2003.

Farwer B and Misra K (2003). Modelling with Hierarchical Object Petri Nets, Fundamenta Informaticae, 55:2, (129-147), Online publication date: 1-Apr-2003.

Kobayashi N (2003). Time regions and effects for resource usage analysis, ACM SIGPLAN Notices, 38:3, (50-61), Online publication date: 18-Mar-2003.

Inverardi P and Tivoli M (2003). Deadlock-free software architectures for COM/DCOM applications, Journal of Systems and Software, 65:3, (173-183), Online publication date: 15-Mar-2003.

López N, Núñez M, Rodríguez I and Rubio F A multi-agent system for e-barter including transaction and shipping costs Proceedings of the 2003 ACM symposium on Applied computing, (587-594)

Viroli M Comparing semantic frameworks for coordination Proceedings of the 2003 ACM symposium on Applied computing, (394-401)

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

Roman G and Payton J Mobile UNITY schemas for agent coordination Proceedings of the abstract state machines 10th international conference on Advances in theory and practice, (126-150)

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 (2003). Review of the π-calculus, ACM SIGACT News, 34:1, (17-24), Online publication date: 1-Mar-2003.

Jin Y, Esser R and Lakos C Lightweight consistency analysis of dataflow process networks Proceedings of the 26th Australasian computer science conference - Volume 16, (291-300)

Stannett M (2003). Computation and Hypercomputation, Minds and Machines, 13:1, (115-153), Online publication date: 1-Feb-2003.

Kobayashi N Time regions and effects for resource usage analysis Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation, (50-61)

Lin H (2003). Complete inference systems for weak bisimulation equivalences in the π-calculus, Information and Computation, 180:1, (1-29), Online publication date: 10-Jan-2003.

Stirling C Bisimulation and language equivalence Logic for concurrency and synchronisation, (269-284)

Dam M Proof systems for π-calculus logics Logic for concurrency and synchronisation, (145-212)

Levi F and Sangiorgi D (2003). Mobile safe ambients, ACM Transactions on Programming Languages and Systems, 25:1, (1-69), Online publication date: 1-Jan-2003.

Fu Y and Yang Z (2003). Understanding the mismatch combinator in Chi calculus, Theoretical Computer Science, 290:1, (779-830), Online publication date: 1-Jan-2003.

Bravetti M and Aldini A (2003). Discrete time generative-reactive probabilistic processes with different advancing speeds, Theoretical Computer Science, 290:1, (355-406), Online publication date: 1-Jan-2003.

Bernardo M and Bravetti M (2003). Performance measure sensitive congruences for Markovian process algebras, Theoretical Computer Science, 290:1, (117-160), Online publication date: 1-Jan-2003.

Niu J, Atlee J and Day N Composable semantics for model-based notations Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering, (149-158)

Niu J, Atlee J and Day N (2002). Composable semantics for model-based notations, ACM SIGSOFT Software Engineering Notes, 27:6, (149-158), Online publication date: 1-Nov-2002.

Buchholz P and Kemper P (2002). Hierarchical Reachability Graph Generation for Petri Nets, Formal Methods in System Design, 21:3, (281-315), Online publication date: 1-Nov-2002.

Ulidowski I and Phillips I (2002). Ordered SOS process languages for branching and Eager bisimulation, Information and Computation, 178:1, (180-213), Online publication date: 10-Oct-2002.

Best E, Devillers R and Koutny M (2002). The box algebra = Petri nets + process expressions, Information and Computation, 178:1, (44-100), Online publication date: 10-Oct-2002.

Braga C, Hæusler E, Meseguer J and Mosses P Mapping modular SOS to rewriting logic Proceedings of the 12th international conference on Logic based program synthesis and transformation, (262-277)

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)

Rimassa G and Viroli M An operational framework for the semantics of agent communication languages Proceedings of the 3rd international conference on Engineering societies in the agents world III, (111-125)

Kleist J and Sangiorgi D (2002). Imperative objects as mobile processes, Science of Computer Programming, 44:3, (293-342), Online publication date: 1-Sep-2002.

Viry P (2002). Equational rules for rewriting logic, Theoretical Computer Science, 285:2, (487-517), Online publication date: 28-Aug-2002.

Gadducci F and Montanari U (2002). Comparing logics for rewriting, Theoretical Computer Science, 285:2, (319-358), Online publication date: 28-Aug-2002.

Clavel M, Durán F, Eker S, Lincoln P, Martí-Oliet N, Meseguer J and Quesada J (2002). Maude, Theoretical Computer Science, 285:2, (187-243), Online publication date: 28-Aug-2002.

Farwer B and Misra K (2002). Modelling with hierarchical object Petri nets, Fundamenta Informaticae, 55:2, (129-147), Online publication date: 1-Aug-2002.

Balsamo S, Bernardo M and Simeoni M Combining stochastic process algebras and queueing networks for software architecture analysis Proceedings of the 3rd international workshop on Software and performance, (190-202)

Abate P and Bernardo M A scalable approach to the design of SW architectures with dynamically created/destroyed components Proceedings of the 14th international conference on Software engineering and knowledge engineering, (255-262)

Viroli M and Omicini A Specifying agent observable behaviour Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2, (712-720)

Buchholz P and Kemper P (2002). Efficient Computation and Representation of Large Reachability Sets for Composed Automata, Discrete Event Dynamic Systems, 12:3, (265-286), Online publication date: 1-Jul-2002.

Trinder P, Loidl H and Pointon R (2002). Parallel and Distributed Haskells, Journal of Functional Programming, 12:5, (469-510), Online publication date: 1-Jul-2002.

Focardi R and Rossi S Information Flow Security in Dynamic Contexts Proceedings of the 15th IEEE workshop on Computer Security Foundations

Halpern J and O'Neill K Secrecy in Multiagent Systems Proceedings of the 15th IEEE workshop on Computer Security Foundations

Graubmann P and Rudolph E MSC connectors - the philosopher's stone Proceedings of the 3rd international conference on Telecommunications and beyond: the broader applicability of SDL and MSC, (199-220)

Eshuis R and Fokkinga M (2002). Comparing refinements for failure and bisimulation semantics, Fundamenta Informaticae, 52:4, (297-321), Online publication date: 30-Apr-2002.

Cavalcanti A and Sampaio A From CSP-OZ to Java with Processes Proceedings of the 16th International Parallel and Distributed Processing Symposium

Rocha R, Silva F and Costa V Achieving Scalability in Parallel Tabled Logic Programs Proceedings of the 16th International Parallel and Distributed Processing Symposium

Ying M (2002). Bisimulation indexes and their applications, Theoretical Computer Science, 275:1-2, (1-68), Online publication date: 28-Mar-2002.

Peters J, Skowron A, Stepaniuk J and Ramanna S (2002). Towards an ontology of approximate reason, Fundamenta Informaticae, 51:1, (157-173), Online publication date: 15-Mar-2002.

Kučera A and Mayr R (2002). Simulation preorder over simple process algebras, Information and Computation, 173:2, (184-198), Online publication date: 15-Mar-2002.

Harel D, Kupferman O and Vardi M (2002). On the complexity of verifying concurrent transition systems, Information and Computation, 173:2, (143-161), Online publication date: 15-Mar-2002.

Bettini L, Loreti M and Pugliese R An infrastructure language for open nets Proceedings of the 2002 ACM symposium on Applied computing, (373-377)

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)

Suciu D (2002). Distributed query evaluation on semistructured data, ACM Transactions on Database Systems, 27:1, (1-62), Online publication date: 1-Mar-2002.

Katoen J and D'Argenio P General distributions in process algebra Lectures on formal methods and performance analysis, (375-429)

Segala R Verification of randomized distributed algorithms Lectures on formal methods and performance analysis, (232-260)

Brinksma E and Hermanns H Process algebra and Markov chains Lectures on formal methods and performance analysis, (183-231)

Balbo G Introducation to stochastic Petri nets Lectures on formal methods and performance analysis, (84-155)

Herzog U Formal methods for performance evaluation Lectures on formal methods and performance analysis, (1-37)

Schmidt D Structure-preserving binary relations for program abstraction The essence of computation, (245-265)

Hankin C, Nagarajan R and Sampath P Flow analysis The essence of computation, (135-156)

Lee J and Zic J (2002). On modeling real-time mobile processes, Australian Computer Science Communications, 24:1, (139-147), Online publication date: 1-Jan-2002.

Lee J and Zic J On modeling real-time mobile processes Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4, (139-147)

Misra J (2002). A Simple, Object-Based View of Multiprogramming, Formal Methods in System Design, 20:1, (23-45), Online publication date: 1-Jan-2002.

Gruska D and Maggiolo-Schettini A (2001). Process Algebras for Network Communication, Fundamenta Informaticae, 45:4, (359-378), Online publication date: 1-Dec-2001.

Inverardi P and Scriboni S Connectors Synthesis for Deadlock-Free Component-Based Architectures Proceedings of the 16th IEEE international conference on Automated software engineering

Srinivasa S (2001). Connotations of problem solving, ACM SIGSOFT Software Engineering Notes, 26:6, (80-82), Online publication date: 1-Nov-2001.

Meguerdichian S, Slijepcevic S, Karayan V and Potkonjak M Localized algorithms in wireless ad-hoc networks Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, (106-116)

Sekar R, Ramakrishnan C, Ramakrishnan I and Smolka S Model-Carrying Code (MCC) Proceedings of the 2001 workshop on New security paradigms, (23-30)

Inverardi P and Tivoli M Automatic synthesis of deadlock free connectors for COM/DCOM applications Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering, (121-131)

Ying M and Wirsing M (2001). Recursive equations in higher-order process calculi, Theoretical Computer Science, 266:1-2, (839-852), Online publication date: 6-Sep-2001.

Riely J and Hennessy M (2001). Distributed processes and location failures, Theoretical Computer Science, 266:1-2, (693-735), Online publication date: 6-Sep-2001.

Groote J and van Wamel J (2001). The parallel composition of uniform processes with data, Theoretical Computer Science, 266:1-2, (631-652), Online publication date: 6-Sep-2001.

Srba J (2001). Basic process algebra with deadlocking states, Theoretical Computer Science, 266:1-2, (605-630), Online publication date: 6-Sep-2001.

Fournet C and Laneve C (2001). Bisimulations in the join-calculus, Theoretical Computer Science, 266:1-2, (569-603), Online publication date: 6-Sep-2001.

Boreale M, De Nicola R and Pugliese R (2001). Divergence in testing and readiness semantics, Theoretical Computer Science, 266:1-2, (237-248), Online publication date: 6-Sep-2001.

Inverardi P and Tivoli M (2001). Automatic synthesis of deadlock free connectors for COM/DCOM applications, ACM SIGSOFT Software Engineering Notes, 26:5, (121-131), Online publication date: 1-Sep-2001.

Najm E, Nimour A and Stefani J Behavioural typing for objects and process calculi Formal methods for distributed processing, (281-301)

Agha G, Thati P and Ziaei R Actors Formal methods for distributed processing, (155-176)

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)

Hansel D, Cleaveland R and Smolka S Distributed Prototyping from Validated Specifications Proceedings of the 12th International Workshop on Rapid System Prototyping

Fiore M and Abadi M Computing Symbolic Models for Verifying Cryptographic Protocols Proceedings of the 14th IEEE workshop on Computer Security Foundations

Abadi M Protection in programming-language translations Secure Internet programming, (19-34)

Bang K, Choi J and Yoo C (2001). Comments on 'The Model Checker SPIN', IEEE Transactions on Software Engineering, 27:6, (573-576), Online publication date: 1-Jun-2001.

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)

Gaspari M and Zavattaro G An actor algebra for specifying distributed systems Concurrent object-oriented programming and petri nets, (428-444)

Vernadat F and Azéma P High level transition systems for communicating agents Concurrent object-oriented programming and petri nets, (473-492)

van Eck P, Engelfriet J, Fensel D, van Harmelen F, Venema Y and Willems M (2001). A Survey of Languages for Specifying Dynamics, IEEE Transactions on Knowledge and Data Engineering, 13:3, (462-496), Online publication date: 1-May-2001.

Gilmore S, Hillston J and Ribaudo M (2001). An Efficient Algorithm for Aggregating PEPA Models, IEEE Transactions on Software Engineering, 27:5, (449-464), Online publication date: 1-May-2001.

Smith G and Derrick J (2001). Specification, Refinement and Verification of Concurrent Systems—An Integration of Object-Z and CSP, Formal Methods in System Design, 18:3, (249-284), Online publication date: 1-May-2001.

Igarashi A and Kobayashi N (2001). A generic type system for the Pi-calculus, ACM SIGPLAN Notices, 36:3, (128-141), 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)

Flater D Debugging agent interactions Proceedings of the 2001 ACM symposium on Applied computing, (107-114)

Gruska D and Maggiolo-Schettini A (2001). Process Algebras for Network Communication, Fundamenta Informaticae, 45:4, (359-378), Online publication date: 19-Jan-2001.

Brinksma E and Tretmans J Testing transition systems Modeling and verification of parallel processes, (187-195)

Igarashi A and Kobayashi N A generic type system for the Pi-calculus Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (128-141)

Dong J Model checking the composition of hypermedia design components Proceedings of the 2000 conference of the Centre for Advanced Studies on Collaborative research

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

Cioffi M and Corradini F Specification and Analysis of Timed and Functional TRMCS Behaviours Proceedings of the 10th International Workshop on Software Specification and Design

Brockmeyer M, Jahanian F, Heitmeyer C and Winner E (2000). A Flexible, Extensible Simulation Environment for Testing Real-Time Specifications, IEEE Transactions on Computers, 49:11, (1184-1201), Online publication date: 1-Nov-2000.

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)

Monroy R, Bundy A and Green I (2000). Planning Proofs of Equations in CCS, Automated Software Engineering, 7:3, (263-304), Online publication date: 1-Jul-2000.

Bloom B, Fokkink W and Rob Van Glabbeek Precongruence Formats for Decorated Trace Preorders Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science

Desharnais J, Panangaden P, Jagadeesan R and Gupta V Approximating Labeled Markov Processes Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science

Cattani G and Sewell P Models for Name-Passing Processes Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science

Schnoebelen P and Sidorova N Bisimulation and the reduction of Petri nets Proceedings of the 21st international conference on Application and theory of petri nets, (409-423)

Koutny M A compositional model of time Petri nets Proceedings of the 21st international conference on Application and theory of petri nets, (303-322)

Stirewalt R and Rugaber S (2000). The Model-Composition Problem in User-Interface Generation, Automated Software Engineering, 7:2, (101-124), 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.

Uchihira N, Kawata H and Tamura F (2000). Scenario-Based Hypersequential Programming, International Journal of Parallel Programming, 28:2, (155-157), Online publication date: 1-Apr-2000.

Newman R Designing Hypermedia Documentation for Safety Critical Applications Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)

Tremblay G Formal Methods Proceedings of the 13th Conference on Software Engineering Education & Training

Levi F and Sangiorgi D Controlling interference in ambients Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (352-364)

den Hartog J, de Vink E and de Bakker J (1999). Full Abstractness of a Metric Semantics for Action Refinement, Fundamenta Informaticae, 40:4, (335-382), Online publication date: 1-Dec-1999.

Herzog U (1999). Process algebras are getting mature for performance evaluation?!, ACM SIGMETRICS Performance Evaluation Review, 27:3, (15-18), Online publication date: 1-Dec-1999.

Chen J (1999). On Verifying Distributed Multithreaded Java Programs, Software Quality Journal, 8:4, (321-341), Online publication date: 1-Dec-1999.

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.

Cui Z, Odgers B and Schroeder M An In-Service Agent Monitoring and Analysis System Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence

Shields M (1999). An Acceptance Vector Semantics for Path Programs, Fundamenta Informaticae, 40:2,3, (285-316), Online publication date: 1-Aug-1999.

Clark R and Moreira A (1999). Formal Specifications of User Requirements, Automated Software Engineering, 6:3, (217-232), Online publication date: 1-Jul-1999.

Ying M (1999). Topology in process calculus (I): Limit behaviour of agents, Journal of Computer Science and Technology, 14:4, (328-336), 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

Stevens K, Rotem S and Ginosar R Relative Timing Proceedings of the 5th International Symposium on Advanced Research in Asynchronous Circuits and Systems

Müller-Olm M A modal fixpoint logic with chop Proceedings of the 16th annual conference on Theoretical aspects of computer science, (510-520)

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)

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)

Peleska J and Buth B Formal Methods for the International Space Station ISS Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel), (363-389)

Hutton G (1998). Fold and unfold for program semantics, ACM SIGPLAN Notices, 34:1, (280-288), Online publication date: 1-Jan-1999.

Giannakopoulou D, Kramer J and Cheung S (1999). Behaviour Analysis of Distributed Systems Using the Tracta Approach, Automated Software Engineering, 6:1, (7-35), Online publication date: 1-Jan-1999.

Wang F and Lo C (1999). Procedure-Level Verification of Real-time Concurrent Systems, Real-Time Systems, 16:1, (81-114), Online publication date: 1-Jan-1999.

Duke D, Barnard P, Duce D and May J (1998). Syndetic modelling, Human-Computer Interaction, 13:4, (337-393), 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.

Hutton G Fold and unfold for program semantics Proceedings of the third ACM SIGPLAN international conference on Functional programming, (280-288)

Petitpierre C (1998). Synchronous C++, Computer, 31:9, (65-72), Online publication date: 1-Sep-1998.

Middelburg K (1998). Truth of Duration Calculus Formulae in Timed Frames, Fundamenta Informaticae, 36:2,3, (235-263), Online publication date: 1-Aug-1998.

Nestorov S, Abiteboul S and Motwani R (1998). Extracting schema from semistructured data, ACM SIGMOD Record, 27:2, (295-306), Online publication date: 1-Jun-1998.

Nestorov S, Abiteboul S and Motwani R Extracting schema from semistructured data Proceedings of the 1998 ACM SIGMOD international conference on Management of data, (295-306)

Colby C, Godefroid P and Jagadeesan L (1998). Automatically closing open reactive programs, ACM SIGPLAN Notices, 33:5, (345-357), Online publication date: 1-May-1998.

Colby C, Godefroid P and Jagadeesan L Automatically closing open reactive programs Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, (345-357)

Schmidt D (1998). Trace-Based Abstract Interpretation of Operational Semantics, Lisp and Symbolic Computation, 10:3, (237-271), Online publication date: 1-May-1998.

Colby C, Jagadeesan L, Jagadeesan R, Läufer K and Puchol C Object and concurrency in Triveni Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4, (10-10)

Ferrari G and Montanari U (1998). Parameterized Structured Operational Semantics, Fundamenta Informaticae, 34:1,2, (1-31), Online publication date: 1-Apr-1998.

Katoen J, Langerak R, Brinksma E, Latella D and Bolognesi T (1998). 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.

Léonard L and Leduc G (1998). A Formal Definition of Time in LOTOS, Formal Aspects of Computing, 10:3, (248-266), 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)

Ross B (1998). The Evolution of Concurrent Programs, Applied Intelligence, 8:1, (21-32), Online publication date: 1-Jan-1998.

Erdogmus H (1997). Architecture-driven verification of concurrent systems, Nordic Journal of Computing, 4:4, (380-413), Online publication date: 1-Dec-1997.

Gengler M and Martel M (1997). Self-applicable partial evaluation for the pi-calculus, ACM SIGPLAN Notices, 32:12, (36-46), Online publication date: 1-Dec-1997.

Marinescu M and Goldberg B Partial-evaluation techniques for concurrent programs Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (47-62)

Gengler M and Martel M Self-applicable partial evaluation for the pi-calculus Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (36-46)

Galloway A and Stoddart W An operational semantics for ZCCS Proceedings of the 1st International Conference on Formal Engineering Methods

Smith G and Derrick J Refinement and Verification of Concurrent Systems Specified in Object-Z and CSP Proceedings of the 1st International Conference on Formal Engineering Methods

Taguchi K and Araki K The state-based CCS semantics for concurrent Z specification Proceedings of the 1st International Conference on Formal Engineering Methods

Corsini M and Rauzy A (1997). Toupie, Journal of Automated Reasoning, 19:2, (143-171), Online publication date: 1-Oct-1997.

Focardi R and Gorrieri R (1997). The Compositional Security Checker, IEEE Transactions on Software Engineering, 23:9, (550-571), Online publication date: 1-Sep-1997.

De Giacomo G, Lesperance Y and Levesque H Reasoning about concurrent execution, prioritized interrupts, and exogenous actions in the situation calculus Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2, (1221-1226)

Liu X, Yang H and Zedan H Formal Methods for the Re-Engineering of Computing Systems Proceedings of the 21st International Computer Software and Applications Conference

Baier C and Majster-Cederbaum M (1997). How To Interpret And Establish Consistency Results For Semantics Of Concurrent Programming Languages, Fundamenta Informaticae, 29:3, (225-256), Online publication date: 1-Aug-1997.

Yannakakis M and Lee D (1997). An Efficient Algorithm for Minimizing Real-Time Transition Systems, Formal Methods in System Design, 11:2, (113-136), Online publication date: 1-Aug-1997.

Bastide R and Buchs D Models, Formalisms and Methods for Object-Oriented Distributed Computing (ECOOP Workshop) Proceedings of the Workshops on Object-Oriented Technology, (221-255)

Buchholz P Hierarchical Structuring of Superposed GSPNs Proceedings of the 6th International Workshop on Petri Nets and Performance Models

Hermanns H, Herzog U, Mertsiotakis V and Rettelbach M Exploiting Stochastic Process Algebra Achievements for Generalized Stochastic Petri Nets Proceedings of the 6th International Workshop on Petri Nets and Performance Models

Mertsiotakis V and Silva M Throughput Approximation of Decision Free Processes Using Decomposition Proceedings of the 6th International Workshop on Petri Nets and Performance Models

Bose S, Mukhopadhyay S and Patra A (1997). A Nondeterministic Extension over Finitely Recursive ProcessModel, Discrete Event Dynamic Systems, 7:3, (243-274), Online publication date: 1-Jun-1997.

Alur R, Jagadeesan L, Kott J and Von Olnhausen J Model-checking of real-time systems Proceedings of the 19th international conference on Software engineering, (514-524)

Abadi M and Gordon A A calculus for cryptographic protocols Proceedings of the 4th ACM conference on Computer and communications security, (36-47)

Bloom B, Cheng A and Dsouza A (1997). Using a Protean Language to Enhance Expressiveness in Specification, IEEE Transactions on Software Engineering, 23:4, (224-234), Online publication date: 1-Apr-1997.

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)

Kiehn A and Hennessy M (1997). On the Decidability of Non-Interleaving Process Equivalences, Fundamenta Informaticae, 30:1, (11-30), Online publication date: 1-Jan-1997.

Palamidessi C Comparing the expressive power of the synchronous and the asynchronous π-calculus Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (256-265)

Corradini F and Nicola R (1996). ON FOUR PARTIAL ORDERING SEMANTICS FOR A PROCESS CALCULUS, Fundamenta Informaticae, 27:4, (349-383), Online publication date: 1-Dec-1996.

Ariola Z and Klop J (1996). EQUATIONAL TERM GRAPH REWRITING, Fundamenta Informaticae, 26:3,4, (207-240), 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.

Ponse A (1996). Computable processes and bisimulation equivalence, Formal Aspects of Computing, 8:6, (648-678), Online publication date: 1-Nov-1996.

Lynch N and Vaandrager F (1996). Action transducers and timed automata, Formal Aspects of Computing, 8:5, (499-538), Online publication date: 1-Sep-1996.

Natarajan V and Cleaveland R An Algebraic Theory of Process Efficiency Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Ferreira W, Hennessy M and Jeffrey A (1996). A theory of weak bisimulation for core CML, ACM SIGPLAN Notices, 31:6, (201-212), Online publication date: 15-Jun-1996.

Turbak F (1996). 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)

Buneman P, Davidson S, Hillebrand G and Suciu D (1996). A query language and optimization techniques for unstructured data, ACM SIGMOD Record, 25:2, (505-516), Online publication date: 1-Jun-1996.

Buneman P, Davidson S, Hillebrand G and Suciu D A query language and optimization techniques for unstructured data Proceedings of the 1996 ACM SIGMOD international conference on Management of data, (505-516)

Ardis M, Chaves J, Jagadeesan L, Mataga P, Puchol C, Staskauskas M and Von Olnhausen J (1996). A Framework for Evaluating Specification Methods for Reactive Systems Experience Report, IEEE Transactions on Software Engineering, 22:6, (378-389), Online publication date: 1-Jun-1996.

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)

Kang I and Lee I An efficient state space generation for analysis of real-time systems Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis, (4-13)

Kang I and Lee I (1996). An efficient state space generation for analysis of real-time systems, ACM SIGSOFT Software Engineering Notes, 21:3, (4-13), Online publication date: 1-May-1996.

Mezzanotte M and Paternó F (1996). Including time in the notion of interactor, ACM SIGCHI Bulletin, 28:2, (57-61), Online publication date: 1-Apr-1996.

Inverardi P and Yankelevich D Relating CHAM Descriptions of Software Architectures Proceedings of the 8th International Workshop on Software Specification and Design

Focardi R Comparing Two Information Flow Security Properties Proceedings of the 9th IEEE workshop on Computer Security Foundations

Maung I (1995). On simulation, subtyping and substitutability in sequential object systems, Formal Aspects of Computing, 7:6, (620-651), Online publication date: 1-Nov-1995.

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)

Celikkan U and Cleaveland R (1995). 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

An efficient method for protocol conversion Proceedings of the 4th International Conference on Computer Communications and Networks

Ladkin P and Leue S (1995). Interpreting Message Flow Graphs, Formal Aspects of Computing, 7:5, (473-509), Online publication date: 1-Sep-1995.

Valmari A and Tienari M (1995). Compositional failure-based semantic models for Basic LOTOS, Formal Aspects of Computing, 7:4, (440-468), Online publication date: 1-Jul-1995.

Cridlig R Semantic analysis of shared-memory concurrent languages using abstract model-checking Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (214-225)

Nielsen M and Clausen C (1995). Games and logics for a noninterleaving bisimulation, Nordic Journal of Computing, 2:2, (221-249), Online publication date: 1-Jun-1995.

Leth L and Thomsen B (1995). Some facile chemistry, Formal Aspects of Computing, 7:3, (314-328), Online publication date: 1-May-1995.

Smith G (1995). A fully abstract semantics of classes for Object-Z, Formal Aspects of Computing, 7:3, (289-313), Online publication date: 1-May-1995.

Lynch N and Segala R (1995). A comparison of simulation techniques and algebraic techniques for verifying concurrent systems, Formal Aspects of Computing, 7:3, (231-265), Online publication date: 1-May-1995.

Inverardi P and Wolf A (1995). Formal Specification and Analysis of Software Architectures Using the Chemical Abstract Machine Model, IEEE Transactions on Software Engineering, 21:4, (373-386), Online publication date: 1-Apr-1995.

Kobayashi N and Yonezawa A (1995). Asynchronous communication model based on linear logic, Formal Aspects of Computing, 7:2, (113-149), Online publication date: 1-Mar-1995.

Sands D Total correctness by local improvement in program transformation Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (221-232)

Focardi R and Gorrieri R (1995). A Classification of Security Properties for Process Algebras, Journal of Computer Security, 3:1, (5-33), Online publication date: 1-Jan-1995.

Inverardi P, Priami C and Yankelevich D (1994). Automatizing Parametric Reasoning on Distributed Concurrent Systems, Formal Aspects of Computing, 6:6, (676-695), Online publication date: 1-Dec-1994.

Ladkin P and Simons B Static analysis of multiway synchronization Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research

Ravn A and Staunstrup J Interface models Proceedings of the 3rd international workshop on Hardware/software co-design, (157-164)

Freitag B, Margaria T and Steffen B (1994). A pragmatic approach to software synthesis, ACM SIGPLAN Notices, 29:8, (46-58), Online publication date: 1-Aug-1994.

Freitag B, Margaria T and Steffen B A pragmatic approach to software synthesis Proceedings of the Workshop on Interface Definition Languages, (46-58)

Aziz A, Balarin F, Cheng S, Hojati R, Kam T, Krishnan S, Ranjan R, Shiple T, Singhal V, Tasiran S, Wang H, Brayton R and Sangiovanni-Vincentelli A HSIS Proceedings of the 31st annual Design Automation Conference, (454-459)

Bloom B (2022). When is partial trace equivalence adequate?, Formal Aspects of Computing, 6:3, (317-338), Online publication date: 1-May-1994.

Montanari U and Yankelevich D (1994). Combining Ccs And Petri Nets Via Structural Axioms, Fundamenta Informaticae, 20:1,2,3, (193-229), Online publication date: 1-Apr-1994.

Aceto L (2022). A static view of localities, Formal Aspects of Computing, 6:2, (201-222), Online publication date: 1-Mar-1994.

Nielson H and Nielson F Higher-order concurrent programs with finite communication topology (extended abstract) Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (84-97)

Saeki M, Hiroi T and Ugai T Reflective specification Proceedings of the 7th international workshop on Software specification and design, (204-213)

Astesiano E and Reggio G Specifying reactive systems by abstract events Proceedings of the 7th international workshop on Software specification and design, (122-131)

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 (1993). Enhancing compositional reachability analysis with context constraints, ACM SIGSOFT Software Engineering Notes, 18:5, (115-125), Online publication date: 1-Dec-1993.

Kontogiannis K Program representation and behavioural matching for localizing similar code fragments Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1, (194-205)

Gordon A An operational semantics for I/O in a lazy functional language Proceedings of the conference on Functional programming languages and computer architecture, (136-145)

McCarthy J, Miles V, Monk A, Harrison M, Dix A and Wright P (1993). Text-based on-line conferencing, Human-Computer Interaction, 8:2, (147-183), Online publication date: 1-Jun-1993.

Gay S A sort inference algorithm for the polyadic π-calculus Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (429-438)

Kontogiannis K Toward program representation and program understanding using process algebras Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1, (299-317)

Balcázar J, Gabarró J and Sántha M (1992). Deciding bisimilarity isP-complete, Formal Aspects of Computing, 4:Suppl 1, (638-648), Online publication date: 1-Nov-1992.

Orava F and Parrow J (1992). An algebraic verification of a mobile network, Formal Aspects of Computing, 4:6, (497-543), Online publication date: 1-Nov-1992.

Takashio K and Tokoro M (1992). DROL, ACM SIGPLAN Notices, 27:10, (276-294), Online publication date: 31-Oct-1992.

Llamosí A (1992). On Ada packages, types and task types, ACM SIGAda Ada Letters, XII:5, (47-58), Online publication date: 1-Oct-1992.

Guerraoui R (1992). Dealing with atomicity in object-based distributed systems, ACM SIGPLAN OOPS Messenger, 3:3, (10-13), Online publication date: 1-Jul-1992.

Ince D (1992). Arrays and pointers considered harmful, ACM SIGPLAN Notices, 27:1, (99-104), Online publication date: 1-Jan-1992.

Yeh W and Young M Compositional reachability analysis using process algebra Proceedings of the symposium on Testing, analysis, and verification, (49-59)

Paliwoda K and Sanders J (1991). An incremental specification of the sliding-window protocol, Distributed Computing, 5:2, (83-94), Online publication date: 1-Sep-1991.

Murphy D and Sanders J (1991). Book reviews, Formal Aspects of Computing, 3:2, (206-212), Online publication date: 1-Jun-1991.

Nierstrasz O and Papathomas M (1991). Towards a type theory for active objects, ACM SIGPLAN OOPS Messenger, 2:2, (89-93), Online publication date: 1-Apr-1991.

Meseguer J (1991). Rewriting as a unified model of concurrency, ACM SIGPLAN OOPS Messenger, 2:2, (86-88), Online publication date: 1-Apr-1991.

Nierstrasz O and Papathomas M Towards a type theory for active objects Proceedings of the workshop on Object-based concurrent programming, (89-93)

Meseguer J Rewriting as a unified model of concurrency Proceedings of the workshop on Object-based concurrent programming, (86-88)

Meseguer J (1990). A logical theory of concurrent objects, ACM SIGPLAN Notices, 25:10, (101-115), Online publication date: 1-Oct-1990.

Meseguer J A logical theory of concurrent objects Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications, (101-115)

Chapman N (2022). Defining, analysing and implementing communication protocols using attribute grammars, Formal Aspects of Computing, 2:1, (359-392), Online publication date: 1-Mar-1990.

Dybjer P and Sander H (2022). 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.

Sun Q, Jansen D, Liu X and Zhang W Rooted Divergence-Preserving Branching Bisimilarity is a Congruence for Guarded CCS, Formal Aspects of Computing, 0:0

Akroun L, Benatallah B, Nourine L and Toumani F Decidability and Complexity of Simulation Preorder for Data-Centric Web Services Service-Oriented Computing, (535-542)

Steffen B and Jasper M Generating Hard Benchmark Problems for Weak Bisimulation From Reactive Systems to Cyber-Physical Systems, (126-145)

Hartmanns A and Hermanns H A Modest Markov Automata Tutorial Reasoning Web. Explainable Artificial Intelligence, (250-276)

Bernardeschi C and Domenici A Application of Model Checking to Fault Tolerance Analysis From Software Engineering to Formal Methods and Tools, and Back, (531-547)

Groote J and de Vink E An Axiomatization of Strong Distribution Bisimulation for a Language with a Parallel Operator and Probabilistic Choice From Software Engineering to Formal Methods and Tools, and Back, (449-463)