5838 search results - page 773 / 1168 » A File System for System Programming in Ubiquitous Computing |
180
click to vote
ICALP
2007
Springer
16 years 15 days ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
184
click to vote
SEW
2006
IEEE
16 years 11 days ago
2006
IEEE
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
153
click to vote
ICTCS
2005
Springer
15 years 12 months ago
2005
Springer
In the design of type systems for XML programming languages based on regular expression types and patterns the focus has been over result analysis, with the main aim of statically ...
151
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown t...
188
click to vote
TYPES
2004
Springer
15 years 11 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...