Sciweavers

2145 search results - page 205 / 429
» Lax Logical Relations
Sort
View
ICST
2008
IEEE
14 years 2 months ago
Test-Driven Assessment of Access Control in Legacy Applications
If access control policy decision points are not neatly separated from the business logic of a system, the evolution of a security policy likely leads to the necessity of changing...
Yves Le Traon, Tejeddine Mouelhi, Alexander Pretsc...
WCFLP
2005
ACM
14 years 1 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
SAT
2005
Springer
145views Hardware» more  SAT 2005»
14 years 1 months ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman
TCS
2008
13 years 8 months ago
Density elimination
Density elimination, a close relative of cut elimination, consists of removing applications of the Takeuti-Titani density rule from derivations in Gentzen-style (hypersequent) cal...
Agata Ciabattoni, George Metcalfe
DLOG
2010
13 years 6 months ago
Towards Formal Comparison of Ontology Linking, Mapping and Importing
Multiple distributed and modular ontology representation frameworks have recently appeared. They typically extend Description Logics (DL), with new constructs to represent relation...
Martin Homola, Luciano Serafini