Sciweavers

3564 search results - page 473 / 713
» Evaluating a Formal Modelling Language
Sort
View
EMNLP
2009
15 years 4 months ago
Unsupervised morphological segmentation and clustering with document boundaries
Many approaches to unsupervised morphology acquisition incorporate the frequency of character sequences with respect to each other to identify word stems and affixes. This typical...
Taesun Moon, Katrin Erk, Jason Baldridge
ASE
2002
160views more  ASE 2002»
15 years 6 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
ENTCS
2006
146views more  ENTCS 2006»
15 years 7 months ago
Relating State-Based and Process-Based Concurrency through Linear Logic
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
Iliano Cervesato, Andre Scedrov
WWW
2007
ACM
16 years 7 months ago
Compiling cryptographic protocols for deployment on the web
Cryptographic protocols are useful for trust engineering in Web transactions. The Cryptographic Protocol Programming Language (CPPL) provides a model wherein trust management anno...
Jay A. McCarthy, Shriram Krishnamurthi, Joshua D. ...
TLCA
2009
Springer
16 years 1 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann