Filters








854 Hits in 8.6 sec

A Parameterised Hierarchy of Argumentation Semantics for Extended Logic Programming and its Application to the Well-founded Semantics [article]

Ralf Schweimeier, Michael Schroeder
2003 arXiv   pre-print
In this paper, we formulate a variety of notions of attack for extended logic programs from combinations of undercuts and rebuts and define a general hierarchy of argumentation semantics parameterised  ...  Most significantly, we place existing semantics put forward in the literature in our hierarchy and identify a particular argumentation semantics for which we prove equivalence to the paraconsistent well-founded  ...  Acknowledgement Thanks to Iara Carnevale de Almeida and José Júlio Alferes for fruitful discussions on credulous and sceptical argumentation semantics for extended logic programming.  ... 
arXiv:cs/0311008v1 fatcat:avvmtoz4qfetbbfmhuzit4tpuu

A parameterised hierarchy of argumentation semantics for extended logic programming and its application to the well-founded semantics

RALF SCHWEIMEIER, MICHAEL SCHROEDER
2005 Theory and Practice of Logic Programming  
In this paper, we formulate a variety of notions of attack for extended logic programs from combinations of undercuts and rebuts and define a general hierarchy of argumentation semantics parameterised  ...  Most significantly, we place existing semantics put forward in the literature in our hierarchy and identify a particular argumentation semantics for which we prove equivalence to the paraconsistent well-founded  ...  Acknowledgement Thanks to Iara Carnevale de Almeida and José Júlio Alferes for fruitful discussions on credulous and sceptical argumentation semantics for extended logic programming.  ... 
doi:10.1017/s147106840400225x fatcat:jf26zyb3prd5tld4vuodnd6xi4

Sound refactorings

Márcio Cornélio, Ana Cavalcanti, Augusto Sampaio
2010 Science of Computer Programming  
A set of programming laws is available for the imperative constructs of this language as well as for its object-oriented features; soundness of the laws is proved against a weakest precondition semantics  ...  The proof that the refactoring rules preserve behaviour (semantics) is accomplished by the application of these programming laws and data simulation.  ...  Acknowledgements We would like to thank the anonymous referees for making several suggestions to improve this article.  ... 
doi:10.1016/j.scico.2009.10.001 fatcat:cgquwmmosfhevnib3jnysveoka

Types, subtypes, and ASL+ [chapter]

David Aspinall
1995 Lecture Notes in Computer Science  
We introduce the formal system for proving satisfaction and re nement and describe how it is linked to proof systems of the underlying programming and speci cation languages.  ...  This style of semantics is familiar from subtyping calculi, but a novelty here is the use of a hierarchy of typed domains instead of a single untyped domain.  ...  Thanks are also due to Claudio Russo and Martin Hofmann for discussions about ASL+, and to the anonymous referees of ADT'94 for suggestions to improve the presentation.  ... 
doi:10.1007/bfb0014424 fatcat:smhwraodvzcove6jbtrwqmqdei

Specification Languages [chapter]

Donald Sannella, Martin Wirsing
1999 Algebraic Foundations of Systems Specification  
ACT ONE has a pure initial algebra semantics (Chapter 5) where every type is parameterised (non-parameterised types are considered as a degenerate case) and denotes a free functor.  ...  ACT [CEW93] is an approach to formal software development that includes a language called ACT ONE [Cla89] for writing parameterised specifications, called "types", with conditional equational axioms and  ...  Thanks to Didier Bert, Rȃzvan Diaconescu, Chris George, Bernd Krieg-Brückner, and Horst Reichel for helpful comments.  ... 
doi:10.1007/978-3-642-59851-7_8 dblp:series/ifip/SannellaW99 fatcat:ckfem66gzvcuxidwhhd2k4mttm

A kernel specification formalism with higher-order parameterisation [chapter]

Donald Sannella, Andrzej Tarlecki
1991 Lecture Notes in Computer Science  
It is given a denotational-style semantics, accompanied by an inference system for proving that an object satis es a speci cation.  ...  To deal with both of these in a uniform framework, it was convenient to view speci cations, which specify objects, as objects themselves, and to introduce a notion of a speci cation of speci cations.  ...  Thanks to Jordi Farr es, Cli Jones and Stefan Kahrs for helpful comments on a draft of SST 90], and to Jan Bergstra for a question on -reduction which led to the current v ersion of the system.  ... 
doi:10.1007/3-540-54496-8_15 fatcat:jbwqyr3doraw7bjksbimxt3u3q

Symbolic Functional Evaluation [chapter]

Nancy A. Day, Jeffrey J. Joyce
1999 Lecture Notes in Computer Science  
Symbolic functional evaluation (SFE) is the extension of an algorithm for executing functional programs to evaluate expressions in higher-order logic.  ...  SFE includes general criteria for when to stop evaluation of arguments to uninterpreted functions based on the type of analysis to be performed.  ...  Acknowledgments For helpful discussions and comments on this paper, we thank Byron Cook, Mark Jones, Dick Kieburtz, Jeff Lewis, and John Matthews of OGI, and the reviewers.  ... 
doi:10.1007/3-540-48256-3_23 fatcat:g4ip4kxde5ajdgkm6ifzzgj2sm

Formalisation and analysis of Dalvik bytecode

Erik Ramsgaard Wognsen, Henrik Søndberg Karlsen, Mads Chr. Olesen, René Rydhof Hansen
2014 Science of Computer Programming  
Furthermore, to ensure high-fidelity of such tools, it is essential to formally specify both semantics and analyses.  ...  , misbehaving and malicious (malware) apps are set to become a serious problem.  ...  We would like to thank the anonymous reviewers for catching subtle (and not so subtle) errors and for providing detailed and constructive feedback.  ... 
doi:10.1016/j.scico.2013.11.037 fatcat:odlwuwnvh5dllonx7dxb7hos2y

Algebraic reasoning for object-oriented programming

Paulo Borba, Augusto Sampaio, Ana Cavalcanti, Márcio Cornélio
2004 Science of Computer Programming  
We present algebraic laws for a language similar to a subset of sequential Java that includes inheritance, recursive classes, dynamic binding, access control, type tests and casts, assignment, but no sharing  ...  We also show that they are complete in the sense that they are sufficient to reduce an arbitrary program to a normal form substantially close to an imperative program; the remaining object-oriented constructs  ...  Acknowledgements We thank our collaborator David Naumann for many discussions that significantly contributed to the research reported here. He jointly defined with Ana Cavalcanti the  ... 
doi:10.1016/j.scico.2004.03.003 fatcat:zmgl57jp5bbk7annt556eknycq

Types for Modules

Claudio V. Russo
2004 Electronical Notes in Theoretical Computer Science  
For better or worse, I decided to leave the main body of the work unchanged and to exclude any account of subsequent related research.  ...  However, I have added an epilogue, not contained in [Rus98b] , that relates the thesis to my more recent work on elaborating and implementing my proposed extensions to Modules in Moscow ML [RRS00], a widely  ...  This field of logic has close connections to Computer Science and provides a rational basis for the design of programming languages.  ... 
doi:10.1016/s1571-0661(05)82621-0 fatcat:vbz7dhknzvagjakd5ox6eowifa

Complexity of Abstract Argumentation under a Claim-Centric View

Wolfgang Dvořák, Stefan Woltran
2019 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We, therefore, give a comprehensive complexity analysis of abstract argumentation under a claim-centric view and analyse the four main decision problems under seven popular semantics.  ...  It is solely this relation between arguments that is then used in order to identify acceptable sets of arguments.  ...  This work is supported by the Austrian Science Fund (FWF): grants I2854, P30168 and Y698.  ... 
doi:10.1609/aaai.v33i01.33012801 fatcat:z65adz7zhne6hby5af6bllmohe

A layered formal framework for modeling of cyber-physical systems

George Ungureanu, Ingo Sander
2017 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017  
This yields a holistic, fine-grained, hierarchical and structured view of a cyber-physical system. We demonstrate the various benefits for modeling, analysis and synthesis through a typical example.  ...  Several formal models exist for description and analysis of these aspects, but they focus mainly on a single or only a few system properties.  ...  Partial application is a mechanism based on currying which allows to take functions with arbitrary number of arguments and systematically apply one argument at a time, yielding intermediate functions with  ... 
doi:10.23919/date.2017.7927270 dblp:conf/date/UngureanuS17 fatcat:a3cvydoaf5amhgmwhrnsn3ifpy

Paralocks

Niklas Broberg, David Sands
2010 Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '10  
flow security according to the Paralock semantics.  ...  Furthermore -and unlike the DLM -we provide an information flow semantics for full Paralock policies.  ...  Acknowledgements Thanks to the ProSec group at Chalmers, to Reiner Hähnle and Mike Hicks for useful comments and suggestions.  ... 
doi:10.1145/1706299.1706349 dblp:conf/popl/BrobergS10 fatcat:s4b47igaenfpljuznibdr3x4fu

Paralocks

Niklas Broberg, David Sands
2010 SIGPLAN notices  
flow security according to the Paralock semantics.  ...  Furthermore -and unlike the DLM -we provide an information flow semantics for full Paralock policies.  ...  Acknowledgements Thanks to the ProSec group at Chalmers, to Reiner Hähnle and Mike Hicks for useful comments and suggestions.  ... 
doi:10.1145/1707801.1706349 fatcat:hk4rdeda55c2rlfdn5ni7wimvq

Keynote Address: .QL for Source Code Analysis

Oege de Moor, Mathieu Verbaere, Elnar Hajiyev, Pavel Avgustinov, Torbjorn Ekman, Neil Ongkingco, Damien Sereni, Julian Tibble
2007 Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2007)  
Here we present an object-oriented query language, named .QL, and demonstrate its use for general navigation, bug finding and enforcing coding conventions.  ...  Many tasks in source code analysis can be viewed as evaluating queries over a relational representation of the code.  ...  Datalog Second, .QL is based on Datalog, a very simple form of logic programming that has an elegant leastfixpoint semantics.  ... 
doi:10.1109/scam.2007.4362893 fatcat:pqgtci2cnfhvhivrssy5ivyi3i
« Previous Showing results 1 — 15 out of 854 results