Sciweavers

854 search results - page 34 / 171
» Addressing Dynamic Issues of Program Model Checking
Sort
View
SIGSOFT
2005
ACM
16 years 3 months ago
Lightweight object specification with typestates
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
Kevin Bierhoff, Jonathan Aldrich
OOPSLA
2005
Springer
15 years 7 months ago
Finding application errors and security flaws using PQL: a program query language
A number of effective error detection tools have been built in recent years to check if a program conforms to certain design rules. An important class of design rules deals with s...
Michael C. Martin, V. Benjamin Livshits, Monica S....
AOSD
2003
ACM
15 years 7 months ago
A case for statically executable advice: checking the law of demeter with AspectJ
We define a generic join point model for checking the Law of Demeter (LoD). Join points are trees, pointcuts are predicates over join points, and advice is checked statically sim...
Karl J. Lieberherr, David H. Lorenz, Pengcheng Wu
FORTE
2007
15 years 3 months ago
Transactional Reduction of Component Compositions
Behavioural protocols are beneficial to Component-Based Software Engineering and Service-Oriented Computing as they foster automatic procedures for discovery, composition, composi...
Serge Haddad, Pascal Poizat
119
Voted
USENIX
2001
15 years 3 months ago
User-Level Checkpointing for LinuxThreads Programs
Multiple threads running in a single, shared address space is a simple model for writing parallel programs for symmetric multiprocessor (SMP) machines and for overlapping I/O and ...
William R. Dieter, James E. Lumpp Jr.