Sciweavers

3825 search results - page 309 / 765
» The Language of Time: A Reader
Sort
View
HASKELL
2008
ACM
15 years 7 months ago
Lightweight monadic regions
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
Oleg Kiselyov, Chung-chieh Shan
174
Voted
CL
2010
Springer
15 years 6 months ago
Isolating untrusted software extensions by custom scoping rules
In a modern programming language, scoping rules determine the visibility of names in various regions of a program [15]. In this work, we examine the idea of allowing an applicatio...
Philip W. L. Fong, Simon A. Orr
SCP
1998
163views more  SCP 1998»
15 years 6 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
ICTAC
2009
Springer
16 years 1 months ago
Regular Expressions with Numerical Constraints and Automata with Counters
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
Dag Hovland
TIME
2008
IEEE
16 years 1 months ago
Practical First-Order Temporal Reasoning
In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variet...
Clare Dixon, Michael Fisher, Boris Konev, Alexei L...