191 Hits in 6.6 sec

Page 4763 of Mathematical Reviews Vol. , Issue 94h [page]

1994 Mathematical Reviews  
Summary: “The application of formal methods to the design of correct computer hardware depends crucially on the use of ab- straction mechanisms to partition the synthesis and verification task into tractable  ...  *A modal logic for handling behavioural constraints in formal hardware verification. (English summary) Dissertation, University of Edinburgh, Edinburgh, 1993.  ... 

Page 6094 of Mathematical Reviews Vol. , Issue 98J [page]

1998 Mathematical Reviews  
Finally, the paper explores two concrete models for PLL, applicable to hardware verification, for which the modality o models correctness up to timing constraints.  ...  PLL can be applied to hardware verification, in which the modality o formalizes the notion of correctness up to constraints, the intuitive interpretation of oM being “for some constraint c, formula M holds  ... 

Page 1036 of Mathematical Reviews Vol. , Issue 92b [page]

1992 Mathematical Reviews  
Artemov, Kolmogorov’s logic of prob- lems and a provability interpretation of intuitionistic logic (pp. 257-272); Matthew L. Ginsberg, Bilattices and modal operators (pp. 273-287); Murray S.  ...  The design of. hardware is a process of creating a device that realises an algorithm, and many of the problems are con- cerned with the nature of algorithms that may be realised.  ... 

Page 431 of Mathematical Reviews Vol. , Issue 95a [page]

1995 Mathematical Reviews  
This paper presents specification languages for higher-order func- tionals, and for computable functions; it also gives a framework for the formal verification of hardware and functional programs.  ...  An implementation of this formal system is described; the implemen- tation is written in SCHEME; the built-in evaluation mechanism of SCHEME is used to carry out the normalisation of proofs.  ... 

Categorical and Kripke Semantics for Constructive S4 Modal Logic [chapter]

Natasha Alechina, Michael Mendler, Valeria de Paiva, Eike Ritter
2001 Lecture Notes in Computer Science  
In an attempt to ensure good-quality printouts of our technical reports, from the supplied PDF files, we process to PDF using Acrobat Distiller.  ...  We consider two systems of constructive modal logic which are computationally motivated.  ...  Acknowledgements The second author is supported by EPSRC (grant GR/M99637). We would like to thank Gavin Bierman, Richard Crouch and Matt Fairtlough for their useful comments and suggestions.  ... 
doi:10.1007/3-540-44802-0_21 fatcat:r5r4zdyv7ffsbj55tnrdf5wuxy

Nested Sequents for Intuitionistic Modal Logics via Structural Refinement [article]

Tim S. Lyon
2021 arXiv   pre-print
We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent  ...  to a subclass of the Scott-Lemmon axioms.  ...  Although such logics are interesting in their own right, intuitionistic modal logics have proven useful in practical applications: having been applied in the verification of computer hardware [8] , to  ... 
arXiv:2107.01998v1 fatcat:wevvtz7ih5fq3cebxdk6or3wgm

Automated deduction for verification

Natarajan Shankar
2009 ACM Computing Surveys  
Propositional Logic Propositional logic plays an important role in digital hardware design as well as hardware and software verification.  ...  semantics, as well as the formal specification and verification of hardware and software.  ...  ACKNOWLEDGMENTS Tony Hoare and Jayadev Misra suggested the idea for this survey article and shepherded it through many revisions with copious feedback, advice, and encouragement.  ... 
doi:10.1145/1592434.1592437 fatcat:satgicglyneqvl2nw5pjnr3d3a

A Survey on Theorem Provers in Formal Methods [article]

M. Saqib Nawaz, Moin Malik, Yi Li, Meng Sun, M. Ikram Ullah Lali
2019 arXiv   pre-print
In literature, there is a shortage of comprehensive documents that can provide proper guidance about the preferences of theorem provers with respect to their designs, performances, logical frameworks,  ...  Mechanical reasoning is a key area of research that lies at the crossroads of mathematical logic and artificial intelligence.  ...  ACKNOWLEDGMENTS The work has been supported by the National Natural Science Foundation of China under grant no. 61772038, 61532019 and 61272160, and the Guandong Science and Technology Department (Grant  ... 
arXiv:1912.03028v1 fatcat:fabxqg75xjhxlh7u3uyypgyzdy

Logic in Access Control (Tutorial Notes) [chapter]

Martín Abadi
2009 Lecture Notes in Computer Science  
-Logical approaches for authorizing code execution, such as those based on proofcarrying code (e.g., [53, 59] ). -Formal verification of security properties (e.g., [56] ).  ...  Access control is central to security in computer systems. Over the years, there have been many efforts to explain and to improve access control, sometimes with logical ideas and tools.  ...  for discussions and collaborations that contributed to this paper or to its origins.  ... 
doi:10.1007/978-3-642-03829-7_5 fatcat:w6zkkn6s4zamnpyxwp6utsj6li

Page 2545 of Mathematical Reviews Vol. , Issue 98D [page]

1998 Mathematical Reviews  
Gordon, A sound metalogical semantics for input/output effects (339-353); Matt Fairtlough and Michael Mendler, An intuitionistic modal logic with applications to the formal verification of hardware (354  ...  Benton, A mixed linear and non-linear logic: proofs, terms and models (ex- tended abstract) (121-135); L. Gordeev, Cut free formalization of logic with finitely many variables. I (136-150).  ... 

Proof Theory [article]

Jeremy Avigad
2017 arXiv   pre-print
Proof theory began in the 1920's as a part of Hilbert's program, which aimed to secure the foundations of mathematics by modeling infinitary mathematics with formal axiomatic systems and proving those  ...  Today such a viewpoint has applications in mathematics, computer science, and the philosophy of mathematics.  ...  in second-order logic together with an axiom asserting the existence of an infinite domain.  ... 
arXiv:1711.01994v2 fatcat:3zjao7da6vdljgkb66w2vdjl74

Cover semantics for quantified lax logic

R. Goldblatt
2010 Journal of Logic and Computation  
Lax modalities occur in intuitionistic logics concerned with hardware verification, the computational lambda calculus, and access control in secure systems.  ...  An alternative completeness proof is given for (non-modal) first-order intuitionistic logic itself with respect to the cover semantics, using a simple and explicit Henkin-style construction of a characteristic  ...  The motivation was hardware specification and verification, with a modal formula ϕ being read "there is some constraint under which ϕ is true".  ... 
doi:10.1093/logcom/exq029 fatcat:yn3guzttevh6xdroybia6yvjyi

Bringing Order to the Separation Logic Jungle [chapter]

Qinxiang Cao, Santiago Cuellar, Andrew W. Appel
2017 Lecture Notes in Computer Science  
We prove every separation logic to be sound and complete with respect to this unifying semantics. Further, our framework enables us to generalize the soundness proofs for the frame rule and CSL.  ...  It also reveals a new world of meaningful intermediate separation logics between "intuitionistic" and "classical".  ...  Introduction Separation logic, introduced at the turn of the millennium by Reynolds [32] , has led to tremendous progress in modular verification in a multitude of applications: for reasoning about multiple  ... 
doi:10.1007/978-3-319-71237-6_10 fatcat:p4cvrg65vvcinoocknpvqbkugq

Epistemic Updates on Algebras

Alexander Kurz, Alessandra Palmigiano, Lawrence Moss
2013 Logical Methods in Computer Science  
As an application of this dual characterization, we axiomatize the intuitionistic analogue of the logic of epistemic knowledge and actions, which we refer to as IEAK, prove soundness and completeness of  ...  This dual characterization naturally generalizes to much wider classes of algebras, which include, but are not limited to, arbitrary BAOs and arbitrary modal expansions of Heyting algebras (HAOs).  ...  Here, the dynamic modality disappears, thanks to an application of the appropriate 'preservation of facts' or 'interaction with logical constant' axiom.  ... 
doi:10.2168/lmcs-9(4:17)2013 fatcat:arxterkyivhjppjwmehhe74mm4

The Many Worlds of Modal λ-calculi: I. Curry-Howard for Necessity, Possibility and Time [article]

G. A. Kavvos
2016 arXiv   pre-print
This is a survey of λ-calculi that, through the Curry-Howard isomorphism, correspond to constructive modal logics.  ...  We discuss logical aspects, modal λ-calculi, and their categorical semantics. The logics underlying the calculi surveyed are constructive versions of K, K4, S4, and LTL.  ...  And then, only a few years later, Mendler (1993) developed a logic for the verification of hardware constraits, whose modal propositional fragment turned out to be coincide with Curry and Moggi.  ... 
arXiv:1605.08106v1 fatcat:q2hpdwpddvc43lxcaompezbm5u
« Previous Showing results 1 — 15 out of 191 results