222 Hits in 4.3 sec

Page 1299 of Mathematical Reviews Vol. , Issue 96c [page]

1996 Mathematical Reviews  
(BR-PCRJ-C; Rio de Janeiro) A new, simpler proof of the modularisation theorem for logical specifications. (English summary) Bull. IGPL 1 (1993), no. 1, 3-12.  ...  The paper gives a new proof of the modularization theorem for logical specifications.  ... 

Hierarchical Temporal Specifications of Dynamically Reconfigurable Component Based Systems

Nazareno Aguirre, Tom Maibaum
2004 Electronical Notes in Theoretical Computer Science  
This, in combination with the possibility of hierarchically organising a specification, has a special impact in reasoning, since it allows us to further localise the proof efforts to the relevant subparts  ...  of a specification.  ...  A subsystem is a new unit of modularisation, which encapsulates a dynamically reconfigurable set of interacting components.  ... 
doi:10.1016/j.entcs.2004.01.013 fatcat:pboarwoyvvdd5lcbjqrk2rt2qy

Formalisation and Verification of Java Card Security Properties in Dynamic Logic [chapter]

Wojciech Mostowski
2005 Lecture Notes in Computer Science  
prover for JAVA CARD source code based on a version of Dynamic Logic that models the full JAVA CARD standard.  ...  The properties we consider, are a large subset of properties that are of importance to the smart card industry.  ...  Two main areas for improvement are clearly the modularisation of the proofs and tool support for calculating specifications (more precisely, preconditions).  ... 
doi:10.1007/978-3-540-31984-9_27 fatcat:ztgizmd6anc2jfl25y5vpq2xji

UniForM Perspectives for Formal Methods [chapter]

Bernd Krieg-Brückner
1999 Lecture Notes in Computer Science  
Trends for Formal Methods are reviewed and illustrated by several industrial applications: logical foundations of combination, verification, transformation, testing, and tool support.  ...  The UniForM Workbench is the background for highlighting experiences made over the past 20 years.  ...  Standard Family of Specification Languages A standard formalism for all aspects of formal methods seems pragmatically undesirable (if not impossible) since a projection to a restricted and supposedly simpler  ... 
doi:10.1007/3-540-48257-1_16 fatcat:e6563rfyfref3hodibl3w4tihe

Building Specifications in the Event-B Institution [article]

Marie Farrell, Rosemary Monahan, James F. Power
2021 arXiv   pre-print
This paper describes a formal semantics for the Event-B specification language using the theory of institutions.  ...  One of the principal goals of our semantics is to provide access to the generic modularisation constructs available in institutions, including specification-building operators for parameterisation and  ...  In order to reuse the proofs of the old model, its axioms must then be proven as theorems after instantiation in the new model.  ... 
arXiv:2103.10881v1 fatcat:npfmehfvgfcejcufekkp7yr7fa

Correct and user-friendly implementations of transformation systems [chapter]

Kolyang, T. Santen, B. Wolff
1996 Lecture Notes in Computer Science  
We illustrate the approach by proving and implementing the transformation Global Search on the basis of the tactical theorem prover Isabelle.  ...  We present an approach to integrate several existing tools and methods to a technical framework for correctly developing and executing program transformations.  ...  We would like to thank Maritta Heisel for many discussions on synthesis theorems, and two anonymous referees for very extensive and constructive comments.  ... 
doi:10.1007/3-540-60973-3_111 fatcat:tuiybptrvbatlnbhmjbvnagdee

The UniForM workbench a universal development environment for formal methods [chapter]

Bernd Krieg-Brückner, Jan Peleska, Ernst-Rüdiger Olderog, Alexander Baer
1999 Lecture Notes in Computer Science  
The UniForM Workbench supports combination of Formal Methods (on a solid logical foundation), provides tools for the development of hybrid, real-time or reactive systems, transformation, verification,  ...  Moreover, it comprises a universal framework for the integration of methods and tools in a common development environment. Several industrial case studies are described.  ...  The process algebra has been proved correct; this resulted in ca. 3k theorems, a 17k line proof script, and ca. 3 person-years of effort.  ... 
doi:10.1007/3-540-48118-4_13 fatcat:fwwpfuyds5euzmnl4mts46imqm

Types with semantics

Olha Shkaravska
2005 Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding - MERLIN '05  
Specialised assertions have a uniform format, and soundness proofs of specialised rules employ uniform sequences of steps for a variety of type systems.  ...  The logic is based on the concept of a specialised assertion, which is a predicate expressing the semantics of a typing judgment in a logical framework (here higher-order logic).  ...  The author would like to thank Martin Hofmann and Alberto Momigliano for a few fruitful discussions.  ... 
doi:10.1145/1088454.1088461 dblp:conf/icfp/Shkaravska05 fatcat:r5j427no6fd6xpkqwrs7fdxw2a

Challenge proposal

Max Schäfer, Torbjörn Ekman, Oege de Moor
2008 Proceedings of the 3rd workshop on Programming languages meets program verification - PLPV '09  
They are most useful for gradually improving large existing code bases and it is essential that they work reliably, since even a simple refactoring may affect many different parts of a program, and the  ...  We argue that software refactoring tools are a prime candidate for mechanical verification, offering significant challenges but also the prospect of tangible benefits for real-world software development  ...  Inspiration can be drawn from the success of Rhodium [16] , a domain specific language for declaratively specifying dataflow analyses that are verified by an automatic theorem prover without any need  ... 
doi:10.1145/1481848.1481859 dblp:conf/plpv/SchaferEM09 fatcat:e66bjrk4rjhcnhqzb4dmtznmpi

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

T. S. E. Maibaum
1997 Lecture Notes in Computer Science  
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.  ...  About twenty years ago, together with a group of collaborators, some conjectures were developed about the fundamental principles of a theory of specification.  ...  A nice feature of the work is that the entailment relation of the development logic is a conservative extension of the entailment for the specification logic, thus reusing at the 'specification of logics  ... 
doi:10.1007/bfb0030588 fatcat:rk5h5ieco5gbvkrcwtjzgrwk5m

Customised induction rules for proving correctness of imperative programs

O. Olsson, A. Wallenburg
2005 Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05)  
More specifically, we describe the creation of customised induction rules that are tailor-made for the specific program to verify and thus make the resulting proof simpler.  ...  This time, we make use of failed proof attempts in a theorem prover to gain information about the problem structure and create the partition.  ...  This work was also supported by a STINT (the Swedish Foundation for International Cooperation in Research and Higher Education) grant.  ... 
doi:10.1109/sefm.2005.15 dblp:conf/sefm/OlssonW05 fatcat:ucqksavqsvhwnackkdjpjhhfui

Modularising Verification Of Durable Opacity [article]

Eleni Bila, John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim
2022 arXiv   pre-print
Second, we modularise our existing verification approach by separating the proof of durability of memory accesses from the proof of opacity.  ...  For NOrec, this allows us to re-use an existing opacity proof and complement it with a proof of the durability of accesses to shared state.  ...  Our new approach is inspired by the modularised verification of a filesystem for flash memory [PEB + 17, BSR20].  ... 
arXiv:2011.15013v3 fatcat:uvcaucjt35eblcpqrxebiw5bwi

Compositional Reasoning for Pointer Structures [chapter]

Yifeng Chen, J. W. Sanders
2006 Lecture Notes in Computer Science  
A case study is provided to demonstrate how these ideas are used, in the form of rules of Hoare logic, to verify the correctness of an Object-Oriented program.  ...  It is applied here to the study of disjointness combinators that extend the separating conjunction of Separation Logic.  ...  Acknowledgement The authors are grateful for a variety of refereeing comments that helped them to put the contents of the paper in perspective.  ... 
doi:10.1007/11783596_10 fatcat:x2ixxvynynbm5khpi7kvgpd5wu

SAT and Interactions (Dagstuhl Seminar 20061)

Olaf Beyersdorff, Uwe Egly, Meena Mahajan, Cláudia Nalon
2020 Dagstuhl Reports  
The seminar brought together theoreticians and practitioners from the areas of proof complexity and proof theory, SAT and QBF solving, MaxSAT, and modal logics, who discussed recent developments in their  ...  This report documents the program and the outcomes of Dagstuhl Seminar 20061 "SAT and Interactions".  ...  We show this calculus is the result of a Curry-Howard style interpretation of a deep-inference proof system, and prove that it has natural properties with respect to the lambda-calculus: confluence and  ... 
doi:10.4230/dagrep.10.2.1 dblp:journals/dagstuhl-reports/BeyersdorffEMN20 fatcat:q6vjxmce4bd2nkm3vym2qkvqam

Non-determinsitic algebraic rewriting as adjunction [article]

Răzvan Diaconescu
2022 arXiv   pre-print
result for algebraic rewriting in the context of the pushout-based modularisation technique.  ...  soundness and the completeness of an abstract computational model of rewriting that underlies the non-deterministic programming with Maude and CafeOBJ, and on the other hand for developing a compositionality  ...  This work was supported by a grant of the Romanian Ministry of Education and Research, CNCS -UEFISCDI, project number PN-III-P4-ID-PCE-2020-0446, within PNCDI III.  ... 
arXiv:2204.12133v1 fatcat:hdp6x5n6y5fdral7asqjx4jumi
« Previous Showing results 1 — 15 out of 222 results