Sciweavers

1073 search results - page 117 / 215
» Formal Program Development with Approximations
Sort
View
PLDI
2011
ACM
14 years 5 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
ANSOFT
2002
126views more  ANSOFT 2002»
15 years 2 months ago
The Real-Time Process Algebra (RTPA)
Abstract. The real-time process algebra (RTPA) is a set of new mathematical notations for formally describing system architectures, and static and dynamic behaviors. It is recogniz...
Yingxu Wang
327
Voted
SYNASC
2008
IEEE
300views Algorithms» more  SYNASC 2008»
15 years 9 months ago
A Theory of Adaptable Contract-Based Service Composition
Service Oriented Architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a ...
Giovanni Bernardi, Michele Bugliesi, Damiano Maced...
108
Voted
ICALP
2007
Springer
15 years 8 months ago
Bounded Depth Data Trees
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
Henrik Björklund, Mikolaj Bojanczyk
120
Voted
ICECCS
2005
IEEE
91views Hardware» more  ICECCS 2005»
15 years 8 months ago
Extending SOFL Features for AOP Modeling
SOFL is a formal language and method for software system analysis, specification and design and it fully supports structured techniques and object-oriented techniques. AOP (Aspect...
Yao Shen, Haopeng Chen