Sciweavers

622 search results - page 18 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
FOSSACS
2007
Springer
14 years 2 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
CORR
2004
Springer
124views Education» more  CORR 2004»
13 years 7 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
FM
2009
Springer
124views Formal Methods» more  FM 2009»
14 years 2 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry
CP
2007
Springer
14 years 2 months ago
Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario
Defence trees and CP-net (ceteris paribus network) are two useful approaches that can be used to help a system administrator to analyze a security scenario and to give him a model ...
Stefano Bistarelli, Pamela Peretti, Irina Trubitsy...
CAV
2006
Springer
165views Hardware» more  CAV 2006»
13 years 11 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...