Sciweavers

1226 search results - page 235 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
CCR
2004
147views more  CCR 2004»
14 years 9 months ago
Safe compositional specification of networking systems
The science of network service composition has emerged as one of the grand themes of networking research [17] as a direct result of the complexity and sophistication of emerging n...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
CORR
2004
Springer
176views Education» more  CORR 2004»
14 years 9 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
ENTCS
2000
120views more  ENTCS 2000»
14 years 9 months ago
Efficient Substitution in Hoare Logic Expressions
Substitution plays an important role in Hoare Logic, as it is used in interpreting assignments. When writing a computer-based realization of Hoare Logic, it is therefore important...
Roberto Virga
INTERNET
2002
145views more  INTERNET 2002»
14 years 9 months ago
Where is Middleware?
stract level, remote procedure calls enable programmers to invoke (possibly remote) services as if they were intra-application procedure calls. Much like function or procedure call...
Steve Vinoski
OOPSLA
2010
Springer
14 years 8 months ago
The Spoofax language workbench
Domain-specific languages offer high expressive power foa particular problem domain, abstracting over the accidental complexity associated with traditional software development. ...
Lennart C. L. Kats, Eelco Visser