1888 search results - page 73 / 378 » Proof theory and computational analysis |
CICLING
2005
Springer
15 years 6 months ago
2005
Springer
In this paper a computational model of the Spanish clitic system is presented. In this model clitic pronouns receive a dual analysis in which enclitics are considered inflexions wh...
97
Voted
FECS
2006
15 years 1 months ago
2006
Data Communication and Computer Networking is a traditional undergraduate CS course. Classic teaching focuses on communication protocol and algorithm analysis, plus socket programm...
ECIS
2003
15 years 1 months ago
2003
Research problems in ICT networks often comprise coordination problems of information infrastructures and require state-of-the-art methods of coping with complex system dynamics. ...
101
Voted
STTT
2008
15 years 11 days ago
2008
Abstract. Fast is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under stud...
101
Voted
CADE
2001
Springer
16 years 23 days ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...