Filters








310 Hits in 4.1 sec

Reasoning About Shared-Variable Concurrency: Interactions Between Research Threads [chapter]

Cliff B. Jones
2020 Lecture Notes in Computer Science  
This paper addresses the topic of reasoning formally about concurrent computer programs that execute with variables that are shared between threads.  ...  Abstract: This paper addresses the topic of reasoning formally about concurrent computer programs that execute with variables that are shared between threads.  ...  Acknowledgements This paper is a post-conference version of the talk given at the History of Formal Methods meeting in Porto in October 2019.  ... 
doi:10.1007/978-3-030-54997-8_3 fatcat:wspf5epgrve5vntaobyieillb4

Splitting atoms safely

C.B. Jones
2007 Theoretical Computer Science  
The aim of this paper is to make a contribution to (compositional) development methods for concurrent programs.  ...  In particular, it takes a fresh look at a number of familiar ideas including the problem of interference. Some subtle issues of observabilityincluding granularity -are explored.  ...  Add to this the synchronicity of our birthdays being on the same day of the year, and it was just too tempting an invitation.  ... 
doi:10.1016/j.tcs.2006.12.029 fatcat:zw4q6z6mhndjjbxi3yzna6k5da

The early search for tractable ways of reasoning about programs

C.B. Jones
2003 IEEE Annals of the History of Computing  
is necessary to exploit a notation of compositionality.  ...  Over time it became clear that post facto verification is only practical for small programs and attention turned to verification methods which support the development of programs; for larger programs it  ...  Acknowledgements This text is an extended version of a paper which was to have been published  ... 
doi:10.1109/mahc.2003.1203057 fatcat:xq3pteyxnvfmtct5ahzc3ou6ci

Design, Analysis and Reasoning about Tools: Abstracts from the Third Workshop

Flemming Nielson
1993 DAIMI Report Series  
This establishes a new kind of connection between "realistic" concurrent programming languages and "theoretical" process algebras.  ...  In this talk we illustrate the approach by showing how to analyse the communication behaviour of a program in Concurrent ML with the aim of implementing it on a simple transputer architecture.  ... 
doi:10.7146/dpb.v22i457.6930 fatcat:qqr3ybpuqrc3fmwjlsamx3kuwu

Formalism and method

Egidio Astesiano, Gianna Reggio
2000 Theoretical Computer Science  
To qualify the essential ingredients of a formal method for speciÿcation, we propose a pattern covering the formal and the methodological aspects and also their mutual relationships.  ...  Our pattern includes some novel concepts such as the relationship between end-products and formal models, which allows to relate in a rigorous way di erent methods, outlining the concept of compositionality  ...  Introduction Introducing the case Giving another invited talk, ten years after, at the last edition of TAPSOFT, in an ideal relay with the next year new ETAPS-FASE, inevitably stimulates a re ection  ... 
doi:10.1016/s0304-3975(99)00205-4 fatcat:jeng3hai6vhbzk2bd2ur3aau6e

Formalism and method [chapter]

Egidio Astesiano, Gianna Reggio
1997 Lecture Notes in Computer Science  
To qualify the essential ingredients of a formal method for speciÿcation, we propose a pattern covering the formal and the methodological aspects and also their mutual relationships.  ...  Our pattern includes some novel concepts such as the relationship between end-products and formal models, which allows to relate in a rigorous way di erent methods, outlining the concept of compositionality  ...  Introduction Introducing the case Giving another invited talk, ten years after, at the last edition of TAPSOFT, in an ideal relay with the next year new ETAPS-FASE, inevitably stimulates a re ection  ... 
doi:10.1007/bfb0030590 fatcat:zcmyfdd4gjfanacy2fgj3prwxa

Conservative extensions, interpretations between theories and all that! [chapter]

T. S. E. Maibaum
1997 Lecture Notes in Computer Science  
About twenty years ago, together with a group of collaborators, some conjectures were developed about the fundamental principles of a theory of specification.  ...  The purpose of the paper is to present a retrospective on this work and outline the basic principles of a general theory of specification as we now see it.  ...  The kind invitation to present this invited talk has given me the opportunity to look back over the last 20 eventful years and critically assess the ideas, philosophy, and technical cornerstones of the  ... 
doi:10.1007/bfb0030588 fatcat:rk5h5ieco5gbvkrcwtjzgrwk5m

Cryptographic protocol logic: Satisfaction for (timed) Dolev–Yao cryptography

Simon Kramer
2008 The Journal of Logic and Algebraic Programming  
This article is about a breadth-first exploration of logical concepts in cryptography and their linguistic abstraction and model-theoretic combination in a comprehensive logical system, called CPL (for  ...  The distinguishing feature of CPL is that it unifies and refines a variety of existing approaches.  ...  Acknowledgements I would like to thank Sergei Artëmov, Mika Cohen, Ralf Küsters, and Lawrence Moss for their valuable criticism.  ... 
doi:10.1016/j.jlap.2008.05.005 fatcat:pt4btsr36je7ddyjt6q3m6pzrm

Elucidating concurrent algorithms via layers of abstraction and reification

Cliff B. Jones, Ken G. Pierce
2010 Formal Aspects of Computing  
Abstraction is a key tool even for sequential programs. The purpose here is to explore some abstractions that help readers (and writers) understand the design of concurrent programs.  ...  Arguing that intricate concurrent programs satisfy their specifications can be difficult; recording understandable explanations is important for subsequent readers.  ...  Thanks also go to Peter O'Hearn, Hongseok Yang, Viktor Vafeiadis, Mike Dodds and Matt Parkinson for general and ongoing discussions on development methods for concurrency.  ... 
doi:10.1007/s00165-010-0156-1 fatcat:sncf3smojbh2xhmejlylqjc77a

Scientific Decisions which Characterize VDM [chapter]

Cliff B. Jones
1999 Lecture Notes in Computer Science  
The origins of VDM are normally placed in language description or semantics but it is probably best known in the wider arena of formal methods for (general) program specification and design.  ...  This paper sets out a personal view of some of the key technical decisions which characterize the Vienna Development Method. 1 The papers identified here as important not only represent a personal choice  ...  Peter Lucas was kind enough to comment on a draft of this paper for which I am very thankful.  ... 
doi:10.1007/3-540-48119-2_2 fatcat:m5nkz5ndonf53ap5fxhxlzfjmq

A Formal Basis for Some Dependability Notions [chapter]

Cliff B. Jones
2003 Lecture Notes in Computer Science  
The formalisation is used as a basis for definitions of the notions of fault, error and failure.  ...  This paper shows how formal methods ideas can be used to clarify basic notions used in the field of dependability. Central to this endeavour is fixing a notion of system.  ...  hearings of early versions of the ideas presented here.  ... 
doi:10.1007/978-3-540-40007-3_13 fatcat:ukr44h6ytbbtfk2siuulond2ey

Logical concepts in cryptography

Simon Kramer
2007 ACM SIGACT News  
Furthermore, we sketch an extension of (core) CPL with a notion of probabilistic polynomialtime (PP) computation.  ...  From the meaning of a cryptographic message, we obtain (1) an equational definition of its context-sensitivity, and (2) a formalisation of the first of Abadi and Needham's principles for prudent engineering  ...  advice on the practice of being a Ph.D. student; Henrik Imhof for his abiding Upanishads on mathematical logic; Michael Mendler for our early  ... 
doi:10.1145/1345189.1345205 fatcat:wyk6rfbagbfwrasry7ohjjbq5q

A Naïve Time Analysis and its Theory of Cost Equivalence

DAVID SANDS
1995 Journal of Logic and Computation  
This paper begins with the development of a simple but useful calculus for time analysis of non-strict functional programs with lazy lists.  ...  Techniques for reasoning about extensional properties of functional programs are well understood, but methods for analysing the underlying intensional or operational properties have been much neglected  ...  Special thanks to Richard Bird, who originally suggested to me that a naïve approach could actually be useful for reasoning about call-by-name evaluation, and most recently suggested a number of improvements  ... 
doi:10.1093/logcom/5.4.495 fatcat:tht7uexqanclnk76bq626se2yu

Why use evolving algebras for hardware and software engineering? [chapter]

Egon Börger
1995 Lecture Notes in Computer Science  
I present the salient features of this new method and illustrate them through several examples from my w ork on speci cation and veri cation of programming languages, compilers, protocols and architectures  ...  The de nition of a mathematical model for Hennessy and Patterson's RISC architecture DLX serves as a running example this model is used in 24] to prove the correctness of instruction pipelining.  ...  Last but not least my thanks go to BRICS at the University of Aarhus for the invitation to an intensive and pleasant summer month which allowed me also to nish this paper.  ... 
doi:10.1007/3-540-60609-2_12 fatcat:gpy6rjpo45afxmdpctcwqte6nq

Specifying coalgebras with modal logic

Alexander Kurz
2001 Theoretical Computer Science  
We propose to use modal logic as a logic for coalgebras and discuss it in view of the work done on coalgebras as a semantics of object-oriented programming.  ...  For a certain kind of functor it is shown that the logic exactly captures the notion of bisimulation and a complete calculus is given. Examples of veriÿcations of object properties are given.  ...  Acknowledgements I want to thank Martin R o iger for the good collaboration in preparing the version of the paper for this issue.  ... 
doi:10.1016/s0304-3975(00)00125-0 fatcat:4ebr5fvrpfddjbvocaraywymge
« Previous Showing results 1 — 15 out of 310 results