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.
Filters
Compositional analysis of modular logic programs
1993
Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93
Preserved Fulltext
This paper describes a semantic basis for a compositional approach to the analysis of logic programs. ...
To the best of our knowledge this is the rst account of a compositional framework for the analysis of (logic) programs. ...
In this paper, we give a formal account of how modular logic programs may be analyzed. ...
doi:10.1145/158511.158703
dblp:conf/popl/CodishDG93
fatcat:eiwvhao4qjcazn3onmskmn5pey
Optimizing modular logic languages
1998
ACM Computing Surveys
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 2006; you can also visit the original URL.
The file type is application/pdf.
Modular logic programming has been studied along two orthogonal lines of research (see ] for a survey). ...
Partial Deduction The application of partial deduction in the optimization of modular logic programming was proposed in ] extending the standard definition of partial deduction in logic programming [Lloyd ...
doi:10.1145/289121.289131
fatcat:blxpajjd3nelbjbphypl7paqm4
Applying Model Transformation and Event-B for Specifying an Industrial DSL
2013
ACM/IEEE International Conference on Model Driven Engineering Languages and Systems
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 2022; you can also visit the original URL.
The file type is application/pdf.
To leverage the usage of Event-B and its analysis techniques we developed model transformations, that allowed for automatic generation of Event-B specifications of the DSL programs. ...
The main objective of this work is to enable the industrial use of the broad spectrum of specification analysis tools that support Event-B. ...
We would like to thank Michael Butler and Colin Snook (University of Southampton, United Kingdom) for their help with using Event-B and Rodin. ...
dblp:conf/models/TikhonovaMBAV13
fatcat:6mc4agwzyvbntdfgygtsduw6za
Page 4202 of Mathematical Reviews Vol. , Issue 99f
[page]
1999
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.
modular general logic programs. ...
In a second stage, the obtained results are applied to modular normal logic programs, obtaining a semantics which is correct with respect to the set of logical consequences of the completion of the program ...
An Abstract View on Modularity in Knowledge Representation
2015
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
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 2022; you can also visit the original URL.
The file type is application/pdf.
We demonstrate that recently introduced modular knowledge representation formalisms integrating logic programming with satisfiability and, more generally, with constraint satisfaction can be cast as modular ...
Modularity is an essential aspect of knowledge representation theory and practice. It has received substantial attention. ...
A modular logic program over a vocabulary σ is a set of logic programs over σ. A set X ⊆ σ is an answer set of a modular logic program P if X is an input answer set of every program Π ∈ P. ...
doi:10.1609/aaai.v29i1.9390
fatcat:y24pjiwssrdnvaey4fyftn7syy
Foreword
1996
Theoretical 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.
; and extensions of logic programming. ...
logic programs under a completion semantics. ...
; and extensions of logic programming. ...
doi:10.1016/s0304-3975(96)90229-7
fatcat:vsbnpem6afhhncb4uiysbzv2vm
TACAS 2003 Special Issue—Preface
2006
Theoretical 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 2019; you can also visit the original URL.
The file type is application/pdf.
In their paper "Compositional Analysis for Verification of Parameterized Systems", Basu and Ramakrishnan present a technique based on compositional model checking and program analysis that provides automatic ...
program analysis and verification engines. ...
Conclusion We would like to thank heartily the referees for their expertise and their commitment to the quality of the present special issue. ...
doi:10.1016/j.tcs.2005.11.014
fatcat:wayjlqolubgvpkwhidau222pha
Page 3265 of Mathematical Reviews Vol. , Issue 87f
[page]
1987
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.
From the introduction: “Temporal logic has been investigated extensively in connection with proving properties of programs, especially for programs that involve nondeterminism or concur- rency. ...
) and establish the compatibility of compo-
sition with parameterized actualization (i.e., that an actualization
of the composite M1-M2 can be obtained as a composition of the actualized modules M1 and ...
Three Semantics for Modular Systems
[article]
2014
arXiv
pre-print
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 introduce a multi-language logic of modular systems. We define two novel semantics, a structural operational semantics, and an inference-based semantics. ...
In this paper, we further develop the framework of Modular Systems that lays model-theoretic foundations for combining different declarative languages, agents and solvers. ...
}, P M4 := {L P : b ∨ c ≡ ¬ d}.L WF is the logic of logic programs under the well-founded semantics, L SM is the logic of logic programs under the stable model semantics, L P is propositional logic.The ...
arXiv:1405.1229v1
fatcat:mvvpx37hl5drfhsxop2f5mqbfy
Refinable Function : An Object-oriented Approach to Procedure Modularity
[article]
2021
arXiv
pre-print
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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2017 pre-print arXiv:1707.02590v1 fatcat:okkld3jfz5c3dbccmstmwnhlai
Modularity is the fundamental aspect of modern software engineering, however many advanced modularity techniques requires prospective technologies as part of development and operation process. ...
We introduce the practical aspect of Refinable Function implementation by discussing concerns of applying modularity on asynchronous processing. ...
Object-oriented Approach The common sense of programming for Imperative programming is algorithm plus data, logic programming is rule plus fact. ...
arXiv:1707.02590v2
fatcat:r2ksfcdyunayrl2nmhxvmdueuq
Editorial
1995
Theoretical 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 2019; you can also visit the original URL.
The file type is application/pdf.
To this purpose, they refine the classical temporal logic to a modular temporal logic, where abstraction, composition and refinement are taken into full account, and show how to derive a compositional ...
Mery, in the article On using temporal logic for refinement and compositional verification of concurrent systems, aim at providing the reader with a complete methodology for the compositional specification ...
doi:10.1016/0304-3975(95)90079-9
fatcat:2m3kjfgr25h5di6qn3tv3d3teq
Revisiting Information Hiding: Reflections on Classical and Nonclassical Modularity
[chapter]
2011
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 2011; you can also visit the original URL.
The file type is application/pdf.
We analyze how classical modularity, based on classical logic, fails to address the needs of developers of large software systems, and encourage researchers to explore alternative visions of modularity ...
We submit that the common understanding of modularity, and in particular its notion of information hiding, is deeply rooted in classical logic. ...
The authors of this work are supported by the ERC Starting Grant No. 203099. ...
doi:10.1007/978-3-642-22655-7_8
fatcat:i5p7ezhnrjc7jkdff2uetul6te
Interview with Stephen Brookes and Peter W. O'Hearn Recipients of the 2016 Godel Prize
2016
Bulletin of the European Association for Theoretical 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.
Quoting from the citation for the prize: "Concurrent Separation Logic (CSL) is a revolutionary advance over previous proof systems for verifying properties of systems software, which commonly involve both ...
For the last thirty years experts have regarded pointer manipulation as an unsolved challenge for program verification and shared-memory concurrency as an even greater challenge. ...
Modular proofs were provided of semaphore programs, of a toy memory manager, and programs with interacting resources. ...
dblp:journals/eatcs/Aceto16a
fatcat:r3pfnoyf6fetrdsilyb4rpltxm
CVPP: A Tool Set for Compositional Verification of Control–Flow Safety Properties
[chapter]
2011
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 2013; you can also visit the original URL.
The file type is application/pdf.
Maximal models replace the actual components when verifying the whole program, either for the purposes of modularity of verification or due to unavailability of the component implementations at verification ...
This paper describes CVPP, a tool set for compositional verification of control-flow safety properties for programs with procedures. ...
We are also indebted to Stefan Schwoon, who extended the input language of Moped to serve our needs. ...
doi:10.1007/978-3-642-18070-5_8
fatcat:r57hbpfr3ncqnpe7f3ihfio5zm
Towards a Model for Specifying and Composing Concerns in Software Product Line Engineering
2008
Multikonferenz Wirtschaftsinformatik
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 2022; you can also visit the original URL.
The file type is application/pdf.
Based on these investigations, we present an approach that allows a modular specification and composition of concerns, with the purpose of constructing concrete variants of a software product line. ...
The approach uses concepts from generic and aspect-oriented programming, and adapts them to the requirements imposed by software product line engineering. ...
For an application developer, this avoids the need for a deep knowledge of the domain implementation, since the complexity of program fragment selection and composition can be hidden inside this logical ...
dblp:conf/mkwi/Kuttruff08
fatcat:3sxuh5femve3jbykfwztl5r2ei
« Previous
Showing results 1 — 15 out of 37,292 results