1288 search results - page 169 / 258 » Integrating formal models into the programming languages cou... |
165
click to vote
ICALP
2007
Springer
16 years 15 days ago
2007
Springer
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...
144
click to vote
IFIP
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. This paper proposes a door access control system with mobile phones which allows off-line delegations of an access. A model of door access control with mobile phones is ...
177
click to vote
POPL
2004
ACM
15 years 11 months ago
2004
ACM
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
213
click to vote
IFIP
2001
Springer
15 years 10 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
284
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...