592 search results - page 91 / 119 » Can Component Service-Based Systems Be Proved Correct |
134
Voted
ASWEC
2010
IEEE
15 years 3 months ago
2010
IEEE
—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...
150
Voted
TAP
2010
Springer
15 years 1 months ago
2010
Springer
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...
147
click to vote
ECOOP
1999
Springer
15 years 7 months ago
1999
Springer
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...
144
Voted
FORTE
1997
15 years 4 months ago
1997
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...
141
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
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...