223 search results - page 40 / 45 » Construction of Tree Automata from Regular Expressions |
CIE
2005
Springer
14 years 1 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
KBSE
2010
IEEE
13 years 6 months ago
2010
IEEE
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
IWPC
2005
IEEE
14 years 1 months ago
2005
IEEE
Source code can be viewed in many ways, with each view facilitating access to different information contained within the code. In this working session, we will explore the role th...
ICSE
2003
IEEE-ACM
14 years 21 days ago
2003
IEEE-ACM
Functional requirements contain, and systems exhibit, the behavior summarized below.Despite the advances in software engineering since 1968, how to go from a set of functional req...
IANDC
2007
13 years 7 months ago
2007
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...