Sciweavers

57 search results - page 5 / 12
» Automating Side Conditions in Formalized Partial Functions
Sort
View
ICFP
2005
ACM
14 years 7 months ago
Witnessing side-effects
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
Tachio Terauchi, Alexander Aiken
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
14 years 21 days ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...
DAM
2007
85views more  DAM 2007»
13 years 7 months ago
Testing primitivity on partial words
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
Francine Blanchet-Sadri, Arundhati R. Anavekar
LACL
2005
Springer
14 years 27 days ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis
TPHOL
2008
IEEE
14 years 1 months ago
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for veri...
Sayan Mitra, K. Mani Chandy