12,792 Hits in 6.2 sec

Page 146 of Journal of Research and Practice in Information Technology Vol. 25, Issue 4 [page]

1993 Journal of Research and Practice in Information Technology  
ALPERN, B.L. (1986): Proving Temporal Properties of Concurrent Pro- grams: A Non-Temporal Approach, Ph.D. dissertation, Cornell Univer- sity, TR-86-732.  ...  In effect, typed TAj/os provide a basis for the development of provably correct real-time sys- tems. TL, provides a concise means of expressing properties of automata we wish to prove.  ... 

Verification and specification of concurrent programs [chapter]

Leslie Lamport
1994 Lecture Notes in Computer Science  
I explore the history of, and lessons learned from, eighteen years of assertional methods for specifying and verifying concurrent programs.  ...  I then propose a Utopian future in which mathematics prevails.  ...  The usual approach to specifying real-time systems is to devise a real-time pseudo-programming language or a real-time temporal logic.  ... 
doi:10.1007/3-540-58043-3_23 fatcat:yfizmu2dorhklaj6t2dqsx6pkq

Verifying temporal properties without temporal logic

Bowen Alpern, Fred B. Schneider
1989 ACM Transactions on Programming Languages and Systems  
An approach to proving temporal properties of concurrent programs that does not use temporal logic as an inference system is presented.  ...  The approach is based on using Buchi automata to specify properties. To show that a program satisfies a given property, proof obligations are derived from the Buchi automata specifying that property.  ...  Panangaden, and A. Pnueli made helpful comments on an earlier draft of this paper.  ... 
doi:10.1145/59287.62028 fatcat:el3hbsoq4zdx3p3ibitswpbkgu

On Formal Specification of Emergent Behaviours in Swarm Robotic Systems

Alan FT Winfield, Jin Sa, Mari-Carmen Fernández-Gago, Clare Dixon, Michael Fisher
2005 International Journal of Advanced Robotic Systems  
This paper explores the use of temporal logic to formally specify, and possibly also prove, the emergent behaviours of a robotic swarm.  ...  The paper makes use of a simplified wireless connected swarm as a case study with which to illustrate the approach.  ...  Acknowledgements The authors gratefully acknowledge discussion and feedback from Krysia Broda of the Department of Computing, Imperial College London, and the constructive and insightful comments of the  ... 
doi:10.5772/5769 fatcat:drakhw4xlnfoneiopml7juxz3m

Verification methods for finite systems [chapter]

Ahmed Bouajjani, Joseph Sifakis
1991 Lecture Notes in Computer Science  
The increasing complexity of concurrent systems requires the development of rigorous design methods.  ...  We consider that a system is described by a program. Specifications describe the service provided by the system and  ...  These facts have motivated, during the last decade, active research and development of model-based verification methods applicable to concurrent finite state systems.  ... 
doi:10.1007/3540539816_59 fatcat:so4l25s75faspeiiwg5ygoamle

Model checking concurrent systems with MSVL

Nan Zhang, Zhenhua Duan, Cong Tian
2016 Science China Information Sciences  
Acknowledgements This work was supported by National Natural Science Foundation of China (Grant Nos. 61133001, 61420106004, 91418201).  ...  elements of an argument system; (2) different notations used to model a system and required properties; (3) the expressive power of most often used temporal logics such as Linear Temporal Logic (LTL  ...  To verify whether or not a system satisfies a property, the system is modeled as an MSVL program P and the property is specified by a formula φ of Propositional PTL (PPTL) which is the propositional subset  ... 
doi:10.1007/s11432-015-0882-6 fatcat:xvbfmnjdgzg3zeptcyq366qu74


2021 Zenodo  
Furthermore, the proposed automated verification approach aims to verify the correctness of a finite number of clients each of them iterated infinitely often.  ...  In this research, we used the NuSMV model checker along with Computational Tree Logic (CTL) to verify the correctness of the three-way handshake protocol over specific correctness conditions and properties  ...  Temporal Logic Temporal logic is one of the most important types of logic that is widely used for describing correctness conditions (properties) of different systems.  ... 
doi:10.5281/zenodo.5353200 fatcat:5zzaekqzrndoxgkzgnrgh3h4tm

The temporal semantics of concurrent programs

Amir Pnueli
1981 Theoretical Computer Science  
The basic elements of Temporal Logic are introduced in a particular logic framework DX. The usefulness of Temporal Logic notation in describing properties of concurrent programs is demonstrated.  ...  In order to prove that a program P possesses a property R, one has only to prove the implications W(P) 3 R. An example of such proof is given. It is then demonstrat?  ...  To summarize the benefits of the Temporal Logic approach to semantics and verification: (a) Temporal Logic enables us to express temporal properties for which no previous formalism existed.  ... 
doi:10.1016/0304-3975(81)90110-9 fatcat:ly6omswc6ndq7aj64d77fjkhre

Page 3265 of Mathematical Reviews Vol. , Issue 87f [page]

1987 Mathematical Reviews  
A. (1-TX); Sistla, A. P. (1-MA) Using temporal logic for automatic verification of finite state systems. Logics and models of concurrent systems (La Colle-sur-Loup, 1984), 3-26, NATO Adv. Sci. Inst.  ...  case of finite state systems and can be replaced by a model-theoretic approach which will mechanically determine if the system meets a specification expressed in a propositional temporal logic.  ... 

Extending statecharts with temporal logic

A. Sowmya, S. Ramesh
1998 IEEE Transactions on Software Engineering  
temporal logic, is designed to express the system functions over real time.  ...  In this paper, we explore the utility of a combination of behavior and function specification languages in specifying such systems and verifying their properties.  ...  Isaac, formerly of the Department of Computer Science and Engineering, Indian Institute of Technology, Bombay, for acting as a sounding board for many ideas in this paper.  ... 
doi:10.1109/32.667880 fatcat:l2xjpjo3l5fmnlmmavdyd4z6oa

Page 5447 of Mathematical Reviews Vol. , Issue 88j [page]

1988 Mathematical Reviews  
From the introduction: “A great deal of work has so far gone into developing temporal logic as a tool for specifying and proving the properties of distributed programs.  ...  System Sci. 35 (1987), no. 2, 206-228. The authors introduce a general notion of abstract and concurrent processes, generalizing approaches of Petri, Staples and Nguyen, Milner and others.  ... 

Formalizing and Verifying Decentralized Systems with Extended Concurrent Separation Logic [article]

Yepeng Ding, Hiroyuki Sato
2020 arXiv   pre-print
In this paper, we propose a novel method of formalizing and verifying decentralized systems with a kind of extended concurrent separation logic.  ...  Meanwhile, formalization and verification of the decentralized systems is the key to ensuring correctness of the design and security properties of the implementation.  ...  Model-checking techniques [22, 15, 33] prove to be effective to check safety and liveness properties of distributed system design and algorithms.  ... 
arXiv:2008.08245v1 fatcat:kq7usjbswfd37mbltmst2fie7a

Verifying the correctness of hume programs

Gudmund Grov
2005 Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering - ASE '05  
Bounded time and space usage is achieved by a clear separation of coordination and computation in the design of the language. However, there is no correctness verification.  ...  Hume is a programming language targeted at safety-critical, resource-bounded systems.  ...  Here both the system and the properties are specified in the same logic, creating a more flexible approach than most model checkers, which uses a different system and property notation.  ... 
doi:10.1145/1101908.1101995 dblp:conf/kbse/Grov05 fatcat:grmvdwuzofdsxmvw6jcmsbrc7i

Page 9203 of Mathematical Reviews Vol. , Issue 2004k [page]

2004 Mathematical Reviews  
The lan- guage relies on the use of explicit localities. This paper presents a temporal logic for specifying properties of Klaim programs.  ...  The logic is equipped with a complete proof system that enables one to prove properties of mobile systems.” 2004k:68107 68Q60 68Q45 Demri, Stéphane (F-ENSET-SV; Cachan); D’Souza, Deepak An automata-theoretic  ... 

Strategic directions in concurrency research

Rance Cleaveland, Scott A. Smolka
1996 ACM Computing Surveys  
ACKNOWLEDGMENTS This report has benefited from helpful comments from Chris Hankin, Michael Loui, Jack Stankovic, and Peter Wegner.  ...  In particular, two schools of temporal logic have emerged [Emerson and Halpern 1986 ]: -Linear-time logics permit properties to be stated about the execution sequences a system exhibits.  ...  Similarly, certain correctness properties (e.g., of the form "from any state is it possible to get to a state satisfying proposition p") are expressible in branching-time temporal logic but not in linear-time  ... 
doi:10.1145/242223.242252 fatcat:4gu2wurduveqdhqqrhr27yaqjq
« Previous Showing results 1 — 15 out of 12,792 results