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 application/pdf.
Filters
Generic system support for deductive program development
[chapter]
1996
Lecture Notes in Computer Science
Preserved Fulltext
Within a conservative extension of higher-order logic implemented in the Isabelle system, we derived rules for program development that can simulate those of the deductive tableau proposed by Manna and ...
We report on a case study in using logical frameworks to support the formalization of programming calculi and their application to deduction-based program synthesis. ...
Our research investigates general frameworks that support such program development formalisms. ...
doi:10.1007/3-540-61042-1_52
fatcat:c7xvlbxl6zfybgt2rutkwuedg4
An introduction to deductive database languages and systems
1994
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
has been developed for such systems. ...
There are many application areas for deductive database technology. One area is that of decision support systems. ...
doi:10.1007/bf01228878
fatcat:z3nd6ps5znbt5b65333o4yrxda
A survey of deductive database systems
1995
The Journal of Logic Programming
Preserved Fulltext
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 application/pdf.
Systems based upon these methods are being developed, and offer good support for rule-based applications. ...
They are developing a system that supports modularly stratified negation and aggregation (plus a meta-interpreter for well-founded programs), nonground tuples, and disk-resident relations. ...
doi:10.1016/0743-1066(94)00039-9
fatcat:z75hsj363jcwrdic4ymyi7aop4
Deductive Software Verification: From Pen-and-Paper Proofs to Industrial Tools
[chapter]
2019
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We take stock of the state-of-art and give a list of the most important challenges for the further development of the field of deductive software verification. ...
We follow the trajectory of the field from its inception in the late 1960s via its current state to its promises for the future, from pen-and-paper proofs for programs written in small, idealized languages ...
Schmitt and Bernhard Steffen, for carefully reading our paper and for their very useful feedback. Many thanks to Richard Bubel for help with the preparation of the example in Sect. 2. ...
doi:10.1007/978-3-319-91908-9_18
fatcat:t3verkvbx5givfekzmbpiw6zla
Automated Deduction: Looking Ahead
1999
The AI Magazine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this article, the body of a report on automated deduction is presented that notes some significant achievements and takes a studied look at the future of the field. Articles ...
The workshop on which this article and the underlying report are based was attended by 23 U.S. researchers, listed here; Wolfgang Bibel from the Technische Hochschule Darmstadt, Germany; Kamal Abdali, program ...
Some type of application support package might be a requirement of all application systems using theorem provers; certainly, this general need for support packages seems true of today's automated deduction ...
doi:10.1609/aimag.v20i1.1442
dblp:journals/aim/Loveland99
fatcat:quvjcbyot5fzfga27lzwp6pqwa
Automated deduction: achievements and future directions
2000
Communications of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We use the term AD for automated theorem provers, counterexample (model) generation, and consequence generators, in both fully automated and interactive systems. ...
AD has spawned useful tools and systems, and offers great promise for making substantial progress on some of the most challenging problems in computer science and engineering--such as how to improve the ...
and how best to support this development. ...
doi:10.1145/352515.352529
fatcat:iv3ooanjpjazvmytbmlziih2si
The practice of logical frameworks
[chapter]
1996
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
In addition, some general reasoning systems have been used to study deductions as mathematical objects, without specific support for the domain of deductive systems. ...
In all but the last one, they are programmed in ML which was originally developed to support theorem proving for LCF. Logic programming offers a different approach to meta-programming. ...
doi:10.1007/3-540-61064-2_33
fatcat:4misu6ivoncvhndnxocin3z6ha
Semantically based programming tools (Summary)
[chapter]
1985
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
What deductive support is required? How can we assess the value of proposed derivation structures? ...
S e m a n t i c a l l y B a s e d P r o g r a m m i n g T o o l s ( S u m m a r y ) The design and development of semantically based programming tools is a goal whose fulfillment is unquestionably many ...
We thank Penny Anderson, Scott Dietzen, Paola Giannini, and Carl Gunter for careful readings of this paper on short notice. ...
doi:10.1007/3-540-15198-2_4
fatcat:orkgy6fhm5edvfor5e4ymy4cji
The Key System: Integrating Object-Oriented Design and Formal Methods
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
The KeY system consists of a commercial CASE tool enhanced with functionality for formal specification and deductive verification. ...
(b) deductive verification. ...
Accordingly, a main part of the KeY project is the design and implementation of a software development tool, the KeY system, that strives to improve upon previous tools for formal software development ...
doi:10.1007/3-540-45923-5_23
fatcat:7s5ubpggurd5ln2su5emkpic2u
Practical Aspects of Automated Deduction for Program Verification
2010
Künstliche Intelligenz
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
of modern program verification systems. ...
Program verification is an increasingly important application area for automated deduction. The field has outgrown the area of academic case studies, and industry is showing serious interest. ...
Monolithic Systems. A typical example for a monolithic verification system is the KeY Program Verification System [6, 2] (co-developed by the authors). ...
doi:10.1007/s13218-010-0001-y
fatcat:oungj4soo5dkzpaz4botsf22hq
Software engineering and automated deduction
2014
Proceedings of the on Future of Software Engineering - FOSE 2014
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
How do we generate test instances that explore and examine different parts of the software. ...
advances in automated deduction are also driven by software engineering requirements. ...
Model-Based Development: Some systems for model-based software development, such as [61, 62] , rely increasingly on automated deduction engines. ...
doi:10.1145/2593882.2593899
dblp:conf/icse/VisserBS14
fatcat:cdgga6syovar5hr4mfzjyyi4se
Deductive databases
1990
SIGMOD record
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
For example, a VLSI CAD system typically allows the definitions of "cells, ~ which are designs having other SIGMOD ...
In this paper, we briefly review the key concepts behind deductive databases and their newly developed enabling technology. ...
Some expert system shells support both, but the programmer must select the better strategy for the situation at hand, and code it as part of the actual program. ...
doi:10.1145/122058.122067
fatcat:5r4xfhndfbge5nzq4oqdllwgvu
System Description: Twelf — A Meta-Logical Framework for Deductive Systems
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Twelf is a meta-logical framework for the specification, implementation, and meta-theory of deductive systems from the theory of programming languages and logics. ...
It relies on the LF type theory and the judgments-as-types methodology for specification [HHP93], a constraint logic programming interpreter for implementation [Pfe91] , and the meta-logic M2 for reasoning ...
We would like to thank Iliano Cervesato for his contributions to the logic programming component of Twelf. ...
doi:10.1007/3-540-48660-7_14
fatcat:ysgd47xcbzbybccjwjaecilgke
Page 440 of Mathematical Reviews Vol. , Issue 91A
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “This paper presents a deduction process for a class of logic programs (including Horn clauses and general programs), called first-order programs, which generalizes SLDNF resolution when it is ...
(F-NANC-1)
A deduction procedure for first order programs.
Logic programming (Lisbon, 1989), 585-599, MIT Press Ser. Logic Program., MIT Press, Cambridge, MA-London, 1989. ...
Developing Verified Software Using Leon
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We present Leon, a system for developing functional Scala programs annotated with contracts. Contracts in Leon can themselves refer to recursively defined functions. ...
For counterexample finding it uses these techniques and additionally specification-based test generation. ...
Overview We present Leon, a system supporting the development of functional Scala [21] programs. We illustrate the flavor of program development in Leon, and present techniques deployed in it. ...
doi:10.1007/978-3-319-17524-9_2
fatcat:7662wo733nhhhmxyzzrtsb2ucm
« Previous
Showing results 1 — 15 out of 146,714 results