Sciweavers

458 search results - page 71 / 92
» A Dependently Typed Assembly Language
Sort
View
COLING
2002
13 years 7 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
ECOOP
2010
Springer
14 years 11 days ago
Correct Refactoring of Concurrent Java Code
Automated refactorings as implemented in modern IDEs for Java usually make no special provisions for concurrent code. Thus, refactored programs may exhibit unexpected new concurren...
Max Schäfer, Julian Dolby, Manu Sridharan, Em...
CONCUR
1991
Springer
13 years 11 months ago
A Method for the Development of Totally Correct Shared-State Parallel Programs
Abstract. A syntax-directed formal system for the development of totally correct programs with respect to an (unfair) shared-state parallel programming language is proposed. The pr...
Ketil Stølen
WWW
2009
ACM
14 years 8 months ago
Towards language-independent web genre detection
The term web genre denotes the type of a given web resource, in contrast to the topic of its content. In this research, we focus on recognizing the web genres blog, wiki and forum...
Philipp Scholl, Renato Domínguez Garc&iacut...
DCC
2010
IEEE
14 years 2 months ago
Lossless Compression Based on the Sequence Memoizer
In this work we describe a sequence compression method based on combining a Bayesian nonparametric sequence model with entropy encoding. The model, a hierarchy of Pitman-Yor proce...
Jan Gasthaus, Frank Wood, Yee Whye Teh