A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
the theory of computation or programming language theory. ... The topics addressed by this text are advanced, and require a familiarity with formal logic and, to an extent, the issues of formal semantics and program verification. ...doi:10.1016/0898-1221(82)90057-8 fatcat:zbqokqurjrbxjpnru33tvumgky
The classical theory of computation is not an adequate model of reality for agent-based simulation in the social sciences. ... The paradigm of intentional computation seems to be the only one possible to reflect the multiparadigmatic character of social science in terms of agent-based computational social science. ... One is based on the formal and empirical logic of program verification in which necessary conditions about program behaviors are specified and verified empirically. ...doi:10.1145/1082473.1082772 dblp:conf/atal/DavidSC05 fatcat:exrxyqydlzdzzh3js5yxoafeyq
Mingsheng Ying is an excellent summary and overview of theory and methods for Floyd-Hoare style verification of quantum programs, developed by his group over the past decade. ... Toward Automatic Verification of Quantum Programs by Prof. ... Mingsheng Ying is an excellent summary and overview of theory and methods for Floyd-Hoare style verification of quantum programs, developed by his group over the past decade. ...doi:10.1007/s00165-018-00477-6 fatcat:ls3rwvdcpjblpbklsyxt32xhwq
Acknowledgments We are grateful to two anonymous referees for their detailed and constructive criticism. Their advice lead to substantial improvements. ... introductory books on formal software verification: given a program and a postcondition, it computes the weakest precondition; given additionally a precondition, the system checks whether the program ... Apart from these compulsory courses there are only a few elective ones dealing with formal methods, most notably Computer Aided Verification emphasising model checking [CGP00] , and Formal Verification ...doi:10.1007/s00165-008-0084-5 fatcat:ganizwaybjhcxeynuk33sga4rm
Confidence in the correctness of the proof is very high because it has been generated and checked automatically by computer. ... Verified software consists of programs that have been proved free of certain rigorously specified kinds of error. ... He has proposed program verification as a computer science Grand Challenge. Deductive software verification is a core technology of formal methods. ...doi:10.1109/mis.2006.117 fatcat:e3gffxrewbhubelnmkv7rvrf7i
ICTAC 2014 welcomed submissions from the following areas: automata theory and formal languages; principles and semantics of programming languages; theories of concurrency, mobility and reconfiguration; ... of theories, formal methods and tools for engineering computing systems; service-oriented architectures: models and development methods; models of ... ICTAC 2014 welcomed submissions from the following areas: automata theory and formal languages; principles and semantics of programming languages; theories of concurrency, mobility and reconfiguration; ...doi:10.7561/sacs.2014.2.173 fatcat:6gqkwapiqzc23aok7m2fmydcjy
Lecture Notes in Computer Science
This enables a wide variety of added-value services based on formal reasoning, including verification of parameterized designs and simplification of standards for particular configurations. ... We develop a methodology and tools to systematically formalize such standards, in particular their domain specific calculation methods, in order to support the automatic verification of functional properties ... Acknowledgements The work reported here was supported by the FormalSafe project conducted by DFKI Bremen and funded by the German Federal Ministry of Education and Research (FKZ 01IW07002). ...doi:10.1007/978-3-642-19811-3_7 fatcat:ggsoql7xybhbdghbl6yega4zau
Innovations in computational type theory using Nuprl, 428 Program specification and verification A clausal resolution method for extended compu- tation tree logic ECTL, 141 Proof assistance MizarMode-an ... ; Supporting the formal veri- fication of mathematical texts, 592 Proof systems A general tableau method for propositional inter- val temporal logics: Theory and implementa- tion, 305 Proofs as programs ...doi:10.1016/s1570-8683(06)00055-3 fatcat:yeph4llopfdgjoimxiakdzqqxm
We propose AlgebraicSystems, a conglomeration of algebraic methods to assign semantics and categorical primitives to give computational meaning to relationships between models so that the formalisms and ... Compositional verification attempts to combat emergence by implementing model transformation as structure-preserving maps between model views. ... To be fruitful in the program of compositional systems theory [2, 6] , we must develop a computational interpretation of algebras and their associated horizontal and vertical composition rules. ...arXiv:2203.16343v1 fatcat:3q4f3rfi3rfhbb2lbyxuud4z6i
This paper introduces a methodology to perform formal verification of floating-point C programs. ... Then verification conditions expressing the correctness of the programs are obtained in the usual way and can be discharged interactively with the Coq proof assistant, using an existing Coq formalization ... The authors are also grateful to Micaela Mayero and François Clément for careful readings of this paper. ...doi:10.1109/arith.2007.20 dblp:conf/arith/BoldoF07 fatcat:telnp5fv2zahna7hwovoefirk4
Seger, Formal verification of digital circuits using symbolic ternary system models (33-43); Hiromi Hiraishi, Shintaro Meki and Ki- yoharu Hamaguchi, Vectorized model checking for computation tree logic ... An operational semantics reduces the computation of a program to a sequence of individual steps, suit- able for execution by a machine, and ensures that programs in the language are computable. ...
rules, providing a formal basis in category theory. 6. ... Cut Branches Before Looking for Bugs: Certifiably Sound Verification on Relaxed Slices, by Léchenet, Kosmatov, and Le Gall, studies the delicate issues that arise in the use of program slicing for verification ... rules, providing a formal basis in category theory. 6. ...doi:10.1007/s00165-017-0448-9 fatcat:gdkwkticsbg27mhpb3osedjum4
It was designed for instruction in verification-oriented programming, and the application of formal logic to the study of a program's structure and behavior. ... Axioms and rules for a theory of programming over integers and strings are developed, as well as for elements of the command language. ...doi:10.1016/0898-1221(82)90056-6 fatcat:ss4qhrrhubbe7heh3senhef4oa
In the last decade, active research in the formal methods community brought interesting results and valuable tools. ... Due to the increasing complexity of software systems, there is a growing need for automated and scalable software synthesis and analysis. ... We are grateful to all authors for their contributions and to the reviewers of TACAS'14 and of this special issue for their thorough and valuable work. ...doi:10.1007/s10009-015-0403-0 fatcat:hwu7b64kh5brrlm7spzyucxibe
prove the soundness of a programming logic with respect to the formal semantics of the language; (4) how to use the mechanized and sound logic to develop verification tools with soundness guaranteed; ... A mathematical theory of programming aims to pro- vide a similar basis for specification, design and implementation of component programs. ...
« Previous Showing results 1 — 15 out of 82,207 results