Results 1  10
of
15
Dynamic Logic
 Handbook of Philosophical Logic
, 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract

Cited by 1008 (7 self)
 Add to MetaCart
ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possible values a 2 N. This operation becomes explicit in DL in the form of the program x := ?, called a nondeterministic or wildcard assignment. This is a rather unconventional program, since it is not effective; however, it is quite useful as a descriptive tool. A more conventional way to obtain a square root of y, if it exists, would be the program x := 0 ; while x < y do x := x + 1: (1) In DL, such programs are firstclass objects on a par with formulas, complete with a collection of operators for forming compound programs inductively from a basis of primitive programs. To discuss the effect of the execution of a program on the truth of a formula ', DL uses a modal construct <>', which
Avoiding the Undefined by Underspecification
 Computer Science Today: Recent Trends and Developments, number 1000 in Lecture Notes in Computer Science
, 1995
"... We use the appeal of simplicity and an aversion to complexity in selecting a method for handling partial functions in logic. We conclude that avoiding the undefined by using underspecification is the preferred choice. ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
(Show Context)
We use the appeal of simplicity and an aversion to complexity in selecting a method for handling partial functions in logic. We conclude that avoiding the undefined by using underspecification is the preferred choice.
Dynamic Algebras: Examples, Constructions, Applications
 Studia Logica
, 1991
"... Dynamic algebras combine the classes of Boolean (B 0 0) and regular (R [ ; ) algebras into a single finitely axiomatized variety (B R 3) resembling an Rmodule with "scalar" multiplication 3. The basic result is that is reflexive transitive closure, contrary to the intuition tha ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
(Show Context)
Dynamic algebras combine the classes of Boolean (B 0 0) and regular (R [ ; ) algebras into a single finitely axiomatized variety (B R 3) resembling an Rmodule with "scalar" multiplication 3. The basic result is that is reflexive transitive closure, contrary to the intuition that this concept should require quantifiers for its definition. Using this result we give several examples of dynamic algebras arising naturally in connection with additive functions, binary relations, state trajectories, languages, and flowcharts. The main result is that free dynamic algebras are residually finite (i.e. factor as a subdirect product of finite dynamic algebras), important because finite separable dynamic algebras are isomorphic to Kripke structures. Applications include a new completeness proof for the Segerberg axiomatization of propositional dynamic logic, and yet another notion of regular algebra. Key words: Dynamic algebra, logic, program verification, regular algebra. This paper or...
From church and prior to psl
 In O. Grumberg & H. Veith (Eds.), 25 Years of Model Checking
, 2008
"... Abstract. One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrialstandard propertyspecification language called PSL. This development was enabled by the equally unlikely transformati ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
Abstract. One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrialstandard propertyspecification language called PSL. This development was enabled by the equally unlikely transformation of the mathematical machinery of automata on infinite words, introduced in the early 1960s for secondorder arithmetics, into effective algorithms for modelchecking tools. This paper attempts to trace the tangled threads of this development.
MetaPRL  A Modular Logical Environment
, 2003
"... MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative project involving several universities in several countries. The MetaPRL system combines the properties of an interactive ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
(Show Context)
MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative project involving several universities in several countries. The MetaPRL system combines the properties of an interactive LCFstyle tacticbased proof assistant, a logical framework, a logical programming environment, and a formal methods programming toolkit. MetaPRL is distributed under an opensource license and can be downloaded from http://metaprl.org/. This paper provides an overview of the system focusing on the features that did not exist in the previous generations of PRL systems.
From monadic logic to PSL
 In Pillars of Computer Science
, 2008
"... Two major themes of my research have been finite model theory and the automata theoretic approach. Boaz Trakhtenbrot laid the foundations in both areas. In 1950, he proved the undecidability of the satisfiability in the finite problem for firstorder logic. His contributions to the automatatheoreti ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
Two major themes of my research have been finite model theory and the automata theoretic approach. Boaz Trakhtenbrot laid the foundations in both areas. In 1950, he proved the undecidability of the satisfiability in the finite problem for firstorder logic. His contributions to the automatatheoretic approach are described in this paper. I met Boaz in a seminar in 1981, when I was a doctoral student. Little did I know then that his work would have such a profound impact on my future research. Abstract. One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrialstandard propertyspecification language called PSL. This development was enabled by the equally unlikely transformation of the mathematical machinery of automata on infinite words, introduced in the early 1960s for secondorder arithmetics, into effective algorithms for modelchecking tools. This paper attempts to trace the tangled threads of this development.
Implementing and automating basic number theory in MetaPRL proof assistant
 Universität Freiburg
, 2003
"... Abstract. No proof assistant can be considered complete unless it provides facilities for basic arithmetical reasoning. Indeed, integer theory is a part of the necessary foundation for most of mathematics, logic and computer science. In this paper we present our approach to implementing arithmetic i ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. No proof assistant can be considered complete unless it provides facilities for basic arithmetical reasoning. Indeed, integer theory is a part of the necessary foundation for most of mathematics, logic and computer science. In this paper we present our approach to implementing arithmetic in the intuitionistic type theory of the MetaPRL proof assistant. We focus on creating an axiomatization that would take advantage of the computational features of MetaPRL type theory. Also, we implement the Arith decision procedure as a tactic that constructs proofs based on existing axiomatization, instead of being a part of the “trusted” code base. 1
The MetaPRL Logical Programming Environment  Volume I
, 2001
"... This thesis is primarily about the design of formal programming environments for building large software systems. This work articulates two principles and uses them to guide the design, implementation, and study of a specific formal programming environment. First, design methods for large software s ..."
Abstract
 Add to MetaCart
This thesis is primarily about the design of formal programming environments for building large software systems. This work articulates two principles and uses them to guide the design, implementation, and study of a specific formal programming environment. First, design methods for large software systems will include multiple languages, methodologies, and refinement techniques that are suited to problem subdomains. This means that any formal system must provide the ability to define multiple logics, and it is by definition a logical framework. Second, the framework must provide the ability to express formal relations between logical theories to address the problem of system decomposition. This thesis also presents the the MetaPRL formal system. MetaPRL was built to provide a modular, abstract logical framework where multiple designs can be expressed and related. The MetaPRL design builds on our experience with logical frameworks and with structured programming concepts like inheritance and reuse to provide an efficient, highly abstract, logical machine. The contribution includes several parts. • The development of an untyped metalogic using explicit substitution. • The definition of a verydependent function type in the Nuprl type theory. • A system architecture for generic multilogical development. • A generic refiner that provides automation and enforcement for the multiple logical theories in logical environment. • A module system for logics and theories. • A generic distributed interactive theorem prover.
Synthesizer: A Synt.ax Directed Programming Environment
"... Programs are not text; they are hierarchical compositions of computational structures and should be edited, executed, and debugged in an environment that consistently acknowledges and reinforces this viewpoint. The Cornell Program Synthesizer demands a structural perspective at all stages of program ..."
Abstract
 Add to MetaCart
(Show Context)
Programs are not text; they are hierarchical compositions of computational structures and should be edited, executed, and debugged in an environment that consistently acknowledges and reinforces this viewpoint. The Cornell Program Synthesizer demands a structural perspective at all stages of program development. Its separate features are unified by a common foundation: a grammar for the programming language. Its fullscreen derivationtree editor and syntaxdirected diagnostic interpreter combine to make the Synthesizer a powerful and responsive interactive programming tool. Key Words and Phrases: programming environment, program development system, syntaxdirected editor,