We propose a modular, assertion-based system for verification and debugging of large logic programs, together with several interesting models for checking assertions statically in modular programs, each with different...
详细信息
ISBN:
(纸本)3540482814
We propose a modular, assertion-based system for verification and debugging of large logic programs, together with several interesting models for checking assertions statically in modular programs, each with different characteristics and representing different trade-offs. Our proposal is a modular and multivariant extension of our previously proposed abstract assertion checking model and we also report on its implementation in the CiaoPP system. In our approach, the specification of the program, given by a set of assertions, may be partial, instead of the complete specification required by traditional verification systems. Also, the system can deal with properties which cannot always be determined at compile-time. As a result, the proposed system needs to work with safe approximations: all assertions proved correct are guaranteed to be valid and all errors actual errors. the use of modular, context-sensitive static analyzers also allows us to introduce a new distinction between assertions checked in a particular context or checked in general.
My work on PhD thesis consists in nonmonotonic reasoning about spatial relations and how they change in time. Although there are several approaches concerning this topic, to the best of my knowledge, there is no gener...
详细信息
Using the constraint-based modeling approach, we have developed a diagnostic component, which is able to identify errors made by learners of a logicprogramming language when implementing a given task specification. I...
详细信息
Semi-structured documents are now commonly used for exchanging information. the aim of this research is to apply deductive and inductive reasoning to semi-structured documents. From our observation that first-order te...
详细信息
the proceedings contain 20 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Using constraints for intrusion detection: the NeMODe system;A declarative ...
ISBN:
(纸本)9783642183775
the proceedings contain 20 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Using constraints for intrusion detection: the NeMODe system;A declarative API for particle Systems;integrating Xpath withthe functional-logic language toy;sloth – A tool for checking minimal-strictness;the F# asynchronous programming model;kanor: A declarative language for explicit communication;joinads: A retargetable control-flow construct for reactive, parallel and concurrent programming;results on out-of-order event processing;nettle: Taking the sting out of programming network routers;learning language from its perceptual context;Determining actual response time in P-FRP;detection of asynchronous message passing errors using static analysis;combinators for message-passing in haskell;analysing a publish/subscribe system for mobile ad hoc networks with problog;profiling for run-time checking of computational properties and performance debugging in logic programs;plato: A compiler for interactive web forms;on the portability of prolog applications;Explicitly recursive grammar combinators: A better model for shallow parser DSLs.
A logic program under the answer set semantics can be inconsistent because its only answer set is the set of all literals, or because it does not have any answer sets. In both cases, the reason for the inconsistency m...
详细信息
this paper describes a compositional analysis algorithm for statically detecting leaks in Java programs. the algorithm is based on separation logic and exploits the concept of bi-abductive inference for identifying th...
详细信息
ISBN:
(纸本)9783642120282
this paper describes a compositional analysis algorithm for statically detecting leaks in Java programs. the algorithm is based on separation logic and exploits the concept of bi-abductive inference for identifying the objects which are reachable but no longer used by the program.
the proceedings contain 23 papers. the topics discussed include: transitive separation logic;unifying lazy and strict computations;foundations of coloring algebra with consequences for feature-oriented programming;tow...
ISBN:
(纸本)9783642333132
the proceedings contain 23 papers. the topics discussed include: transitive separation logic;unifying lazy and strict computations;foundations of coloring algebra with consequences for feature-oriented programming;towards an algebra for real-time programs;automated reasoning in higher-order regular algebra;towards certifiable implementation of graph transformation via relation categories;simple rectangle-based functional programs for computing reflexive-transitive closures;using relations to develop a haskell program for computing maximum bipartite matchings;relations as executable specifications: taming partiality and non-determinism using invariants;left-handed completeness;on completeness of omega-regular algebras;categories of algebraic contexts equivalent to idempotent semirings and domain semirings;and relational representation theorem for powerset quantales.
We present a system capable of automatically solving combinatorial logic puzzles given in (simplified) English. It uses an ontology to represent the puzzles in ASP which is applicable to a large set of logic puzzles. ...
详细信息
Simulation-based testing of autonomous vehicles (AVs) has become an essential complement to road testing to ensure safety. Consequently. substantial research has focused on searching for failure scenarios in simulatio...
详细信息
ISBN:
(纸本)9781665409674
Simulation-based testing of autonomous vehicles (AVs) has become an essential complement to road testing to ensure safety. Consequently. substantial research has focused on searching for failure scenarios in simulation. However, a fundamental question remains: are AV failure scenarios identified in simulation meaningful in reality - i.e., are they reproducible on the real system? Due to the sim-to-real gap arising from discrepancies between simulated and real sensor data, a failure scenario identified in simulation can be either a spurious artifact of the synthetic sensor data or an actual failure that persists with real sensor data. An approach to validate simulated failure scenarios is to identify instances of the scenario in a corpus of real data, and check if the failure persists on the real data. To this end, we propose a formal definition of what it means for a labelled data item to match an abstract scenario, encoded as a scenario program using the SCENIC probabilistic programming language. Using this definition, we develop a querying algorithm which, given a scenario program and a labelled dataset, finds the subset of data matching the scenario. Experiments demonstrate that our algorithm is accurate and efficient on a variety of realistic traffic scenarios, and scales to a reasonable number of agents.
暂无评论