Sciweavers

215 search results - page 37 / 43
» Verifying haskell programs using constructive type theory
Sort
View
OOPSLA
2009
Springer
14 years 1 months ago
Typestate-oriented programming
Objects model the world, and state is fundamental to a faithful modeling. Engineers use state machines to understand and reason about state transitions, but programming languages ...
Jonathan Aldrich, Joshua Sunshine, Darpan Saini, Z...
IBERAMIA
2004
Springer
14 years 10 days ago
Decomposing Ordinal Sums in Neural Multi-adjoint Logic Programs
The theory of multi-adjoint logic programs has been introduced as a unifying framework to deal with uncertainty, imprecise data or incomplete information. From the applicative part...
Jesús Medina, Enrique Mérida Caserme...
ER
2009
Springer
119views Database» more  ER 2009»
14 years 1 months ago
Assessing Modal Aspects of OntoUML Conceptual Models in Alloy
Assessing the quality of conceptual models is key to ensure that conceptual models can be used effectively as a basis for understanding, agreement and construction of information ...
Alessander Botti Benevides, Giancarlo Guizzardi, B...
SIGSOFT
2005
ACM
14 years 7 months ago
Lightweight object specification with typestates
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
Kevin Bierhoff, Jonathan Aldrich
CCS
2005
ACM
14 years 15 days ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...