Sciweavers

592 search results - page 91 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
ASWEC
2010
IEEE
13 years 8 months ago
Non-Monotonic Model Completion in Web Application Engineering
—Formal models are often used to verify systems and prove their correctness, and ensure that transformed models remain consistent to the original system. However, formal techniqu...
Jevon M. Wright, Jens Dietrich
TAP
2010
Springer
134views Hardware» more  TAP 2010»
13 years 5 months ago
Testing First-Order Logic Axioms in Program Verification
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Ki Yung Ahn, Ewen Denney
ECOOP
1999
Springer
14 years 9 hour ago
Inlining of Virtual Methods
We discuss aspects of inlining of virtual method invocations. First, we introduce a new method test to guard inlinings of such invocations, with a di erent set of tradeo s from the...
David Detlefs, Ole Agesen
FORTE
1997
13 years 9 months ago
Automatic Checking of Aggregation Abstractions Through State Enumeration
c Checking of Aggregation Abstractions Through State Enumeration Seungjoon Park, Member, IEEE, Satyaki Das, and David L. Dill, Member, IEEE —Aggregation abstraction is a way of d...
Seungjoon Park, Satyaki Das, David L. Dill
ATAL
2010
Springer
13 years 8 months ago
Verifying agents with memory is harder than it seemed
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
Nils Bulling, Wojciech Jamroga