Filters








12,296 Hits in 4.0 sec

A Constraint Oriented Proof Methodology based on Modal Transition Systems

Kim G. Larsen
1994 BRICS Report Series  
In this paper, we present a constraint-oriented state-based proof methodology for concurrent software systems which exploits compositionality and abstraction for the reduction of the verification problem  ...  Formal basis for this methodology are Modal Transition Systems allowing loose state-based specifications, which can be refined by successively adding constraints.  ...  In this paper, we present a constraint-oriented state-based proof methodology for concurrent software systems which exploits compositionality and abstraction for the reduction of the veri cation problem  ... 
doi:10.7146/brics.v1i47.21595 fatcat:wpmq43ykovbfxkg6opws2klm7e

A constraint oriented proof methodology based on modal transition systems [chapter]

Kim G. Larsen, Bernhard Steffen, Carsten Weise
1995 Lecture Notes in Computer Science  
Formal basis for this methodology are Modal Transition Systems allowing loose state-based specifications, which can be refined by successively adding constraints.  ...  We present a constraint-oriented state-based proof methodology for concurrent software systems which exploits compositionality and abstraction for the reduction of the verification problem under investigation  ...  L is union of some equivalence classes A Constraint Oriented Proof Methodology 35 1 . 1 Adding constraints refines a specification: hs, _ A iEl JEJ ~.  ... 
doi:10.1007/3-540-60630-0_2 fatcat:d67emr2brze6zkpswiikilnhbu

Fischer's protocol revisited: A simple proof using modal constraints [chapter]

Kim G. Larsen, Bernhard Steffen, Carsten Weise
1996 Lecture Notes in Computer Science  
As a case study, we apply a constraint-oriented state-based proof methodology to Fischer's protocol.  ...  Key concepts of the reduction process are modal constraints, separation of proof obligations, Skolemization and abstraction.  ...  As pointed out, a remaining problem are parameters in the timing constraints.  ... 
doi:10.1007/bfb0020979 fatcat:najnciy4vzfwjlge4vqaegmv2u

The methodology of modal constraints [chapter]

Kim G. Larsen, Bernhard Steffen, Carsten Weise
1996 Lecture Notes in Computer Science  
We present a complete solution of the RPC-Memory Speci cation Problem, by applying a constraint-oriented state-based proof methodology for concurrent software systems.  ...  Formal basis for this methodology are Modal Transition Systems allowing loose state-based speci cations, which can be re ned by successively adding constraints.  ...  We are currently investigating methods { similar to the approach presented for parametrized timed automata in AHV93] { for checking bisimulation and (weak) re nement for parametrized modal transition systems  ... 
doi:10.1007/bfb0024437 fatcat:z6zdjwdchfgjvc3ylgq55gsdyu

Page 1597 of Mathematical Reviews Vol. , Issue 93c [page]

1993 Mathematical Reviews  
This consists essentially of a model of information transmission based on situation se- mantics. The author’s choice of logical approach is justified by the nature of information transmission.  ...  Summary: “We present a new, efficient, output-sensitive method for computing the visibility map of a set of c-oriented polyhedra (polyhedra with their faces and edges having at most c different orientations  ... 

Page 6065 of Mathematical Reviews Vol. , Issue 2002H [page]

2002 Mathematical Reviews  
We also discuss where modularization, bisim- ulation, transition systems and combinations of the object, logic, constraint and functional paradigms fit into our hidden agenda.”  ...  In this paper the authors prove decidability of a first-order theory of term algebras extended with queues. 68Q_ Theory of computing 2002h:68136 The proof is based on a quantifier elimination procedure  ... 

Software diversity: state of the art and perspectives

Ina Schaefer, Rick Rabiser, Dave Clarke, Lorenzo Bettini, David Benavides, Goetz Botterweck, Animesh Pathak, Salvador Trujillo, Karina Villela
2012 International Journal on Software Tools for Technology Transfer (STTT)  
Diversity has an impact on all phases of the software development process.  ...  Diversity is prevalent in modern software systems to facilitate adapting the software to customer requirements or the execution environment.  ...  Modal transition systems (MTS) [142] are labelled transition systems with must-and may-transitions.  ... 
doi:10.1007/s10009-012-0253-y fatcat:uicpvxsbm5golmrrves23gopny

Rewriting logic bibliography by topic: 1990–2011

Narciso Martí-Oliet, Miguel Palomino, Alberto Verdejo
2012 The Journal of Logic and Algebraic Programming  
This bibliography compiles, to the best of our knowledge, all the papers on rewriting logic and its applications which have been written during the more than 20 years that have passed since the introduction  ...  In particular, the behavioral approach has given rise to a methodology based on observational transition systems and proof scores, which is well suited for the specification of network protocols and distributed  ...  Indeed, on the one hand one can associate to a rewrite theory a transition system and, with suitable definitions of state predicates, a Kripke structure, and then one can use standard procedures to model  ... 
doi:10.1016/j.jlap.2012.06.001 fatcat:qoyfwnihjfe4bj5drqtk5mlk6a

Modelling Value-oriented Legal Reasoning in LogiKEy [article]

Christoph Benzmüller and David Fuenmayor and Bertram Lomfeld
2022 arXiv   pre-print
The theory obtained is then used to formalise, automatically evaluate, and reconstruct illustrative property law cases (involving appropriation of wild animals) within the Isabelle proof assistant system  ...  The logico-pluralist LogiKEy knowledge engineering methodology and framework is applied to the modelling of a theory of legal balancing in which legal knowledge (cases and laws) is encoded by utilising  ...  As instantiated in the present work, the LOGIKEY methodology builds upon a HOL-encoding of a modal logic of preferences to model a domainspecific theory of value-based legal balancing.  ... 
arXiv:2006.12789v5 fatcat:5hmrok7ls5c6riplcn3v5gvb34

The RPC-memory case study: A synopsis [chapter]

Manfred Broy, Stephan Merz, Katharina Spies
1996 Lecture Notes in Computer Science  
The formalisms that underly the speci cations reect di erent schools of system speci cation, including Petri nets, temporal and higher-order logics, various formats of transition systems or automata, and  ...  The RPC-Memory speci cation problem was proposed by Broy and Lamport as a case study in the formal design of distributed and concurrent systems.  ...  St len on previous versions of this paper.  ... 
doi:10.1007/bfb0024425 fatcat:2nza6f6njbch5c2b37foukh4fa

Actor-Oriented Control System Design: A Responsible Framework Perspective

J. Liu, J. Eker, J.W. Janneck, X. Liu, E.A. Lee
2004 IEEE Transactions on Control Systems Technology  
Index Terms Control system design methodology, heterogeneous modeling, hierarchical heterogeneity, responsible frameworks, actor-oriented design, Ptolemy II  ...  As an example, the methodology and the Ptolemy II software environment is applied to the design of a distributed, real-time software implementation of a pendulum inversion and stabilization system.  ...  ACKNOWLEDGMENTS The authors would like to thank the entire Ptolemy team for inspiring discussion and collaborative implementation on the Ptolemy II software.  ... 
doi:10.1109/tcst.2004.824310 fatcat:jjdlz4zpvbbutpmyzichlfhfsu

Tools for specifying real-time systems

Giacomo Bucci, Maurizio Campanai, Paolo Nesi
1995 Real-time systems  
Many tools have grown out of languages and methodologies proposed in the early 1970s.  ...  Tools for formally specifying software for real-time systems have strongly improved their capabilities in recent years.  ...  In addition, they wish to thank also A. Corgiatini, R. Mattolini, O. Morales, M. Traversi, and E. Vicario, for their help.  ... 
doi:10.1007/bf01094341 fatcat:wmjlzjkegbb2bgi7twtlxffqnq

Verification of Infinite State Systems [chapter]

Ahmed Bouajjani
2003 Lecture Notes in Computer Science  
Verification methods can be deductive (based on the use of theorem provers), or algorithmic (based on decision or semi-decision procedures).  ...  Algorithmic methods can be based on fixpoint theory, automata theory or (constrained) logic programming.  ...  In the talk, which was based on [8], we presented some results on a logic called FLC (Fixpoint Logic with Chop) that extends the modal mu-calculus [6] by a chop operator ';' and termination formulae  ... 
doi:10.1007/978-3-540-45220-1_7 fatcat:4j5lzdbfc5hd7ptdo4tpwvmd2m

A method for rigorous design of reconfigurable systems

Alexandre Madeira, Renato Neves, Luís S. Barbosa, Manuel A. Martins
2016 Science of Computer Programming  
This paper introduces a specification method for reconfigurable software based on a global transition structure to capture the system's reconfiguration space, and a local specification of each operation  ...  Reconfigurability, understood as the ability of a system to behave differently in different modes of operation and commute between them along its lifetime, is a cross-cutting concern in modern Software  ...  The perspective of the presented specification method has several points of contact with these approaches based on structured transition systems.  ... 
doi:10.1016/j.scico.2016.05.001 fatcat:eqtbwavwqfgihmcyuls3vq73oy

Towards a Methodology for Verifying Partial Model Refinements

Rick Salay, Marsha Chechik, Jan Gorzny
2012 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation  
We use this approach to verify both manual refinements and automated transformation-based refinements. We illustrate our approach using example models and transformations.  ...  In previous work, we have defined a general approach for defining partial model semantics using a first order logic encoding.  ...  Partial behavioural modeling formalisms such as Modal Transition Systems (MTSs) [4] allow introduction of uncertainty about transitions on a given event, whereas Disjunctive Modal Transition Systems  ... 
doi:10.1109/icst.2012.199 dblp:conf/icst/SalayCG12 fatcat:v3epn4kwqfddjgalqkcoeld3z4
« Previous Showing results 1 — 15 out of 12,296 results