Sciweavers

1712 search results - page 256 / 343
» Abstract Constraint Data Types
Sort
View
68
Voted
CSL
2008
Springer
15 years 28 days ago
Pure Pointer Programs with Iteration
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
Martin Hofmann, Ulrich Schöpp
FORTE
2008
15 years 18 days ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...
ICALP
2007
Springer
15 years 5 months ago
Succinct Ordinal Trees Based on Tree Covering
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
Meng He, J. Ian Munro, S. Srinivasa Rao
ZUM
2005
Springer
136views Formal Methods» more  ZUM 2005»
15 years 4 months ago
Some Guidelines for Formal Development of Web-Based Applications in B-Method
Abstract. Web-based applications are the most common form of distributed systems that have gained a lot of attention in the past ten years. Today many of us are relying on scores o...
Abdolbaghi Rezazadeh, Michael J. Butler
COOPIS
2003
IEEE
15 years 4 months ago
Analysing Mailboxes of Asynchronous Communicating Components
Abstract. Asynchronous communications are prominent in distributed and mobile systems. Often consystems consider an abstract point of view with synchronous communications. However ...
Jean-Claude Royer, Michael Xu