Sciweavers

1036 search results - page 95 / 208
» Verification Programs for Abduction
Sort
View
DEXA
2000
Springer
76views Database» more  DEXA 2000»
15 years 8 months ago
Semantic Verification of Rule-Based Systems with Arithmetic Constraints
The aim of this paper is to show a method that is able to detect a particular class of semantic inconsistencies in a rule-based system (RBS). A semantic inconsistency is defined by...
Jaime Ramírez, Angélica de Antonio
LOGCOM
2010
128views more  LOGCOM 2010»
14 years 11 months ago
Comparing LTL Semantics for Runtime Verification
When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is,...
Andreas Bauer 0002, Martin Leucker, Christian Scha...
SIGSOFT
2005
ACM
16 years 5 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
HIPC
2007
Springer
15 years 8 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
CORR
2008
Springer
144views Education» more  CORR 2008»
15 years 4 months ago
Modular Compilation of a Synchronous Language
Synchronous languages rely on formal methods to ease the development of applications in an efficient and reusable way. Formal methods have been advocated as a means of increasing t...
Annie Ressouche, Daniel Gaffé, Valér...