Sciweavers

3573 search results - page 323 / 715
» Reasoning about Codata
Sort
View
DSOM
2009
Springer
15 years 11 months ago
One Is Not Enough: A Hybrid Approach for IT Change Planning
Abstract. We propose a novel hybrid planning approach for the automated generation of IT change plans. The algorithm addresses an abstraction mismatch between refinement of tasks ...
Sebastian Hagen, Nigel Edwards, Lawrence Wilcock, ...
ECSQARU
2009
Springer
15 years 11 months ago
A Default Logic Patch for Default Logic
This paper is about the fusion of multiple information sources represented using default logic. More precisely, the focus is on solving the problem that occurs when the standard-lo...
Philippe Besnard, Éric Grégoire, S&e...
FM
2009
Springer
104views Formal Methods» more  FM 2009»
15 years 11 months ago
Verifying Information Flow Control over Unbounded Processes
Abstract. Decentralized Information Flow Control (DIFC) systems enable programmers to express a desired DIFC policy, and to have the policy enforced via a reference monitor that re...
William R. Harris, Nicholas Kidd, Sagar Chaki, Som...
FROCOS
2009
Springer
15 years 11 months ago
Combining Theories with Shared Set Operations
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
Thomas Wies, Ruzica Piskac, Viktor Kuncak
FSTTCS
2009
Springer
15 years 11 months ago
Automata and temporal logic over arbitrary linear time
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
Julien Cristau