Sciweavers

815 search results - page 120 / 163
» Algebraic Recognizability of Languages
Sort
View
SCP
2000
119views more  SCP 2000»
15 years 6 months ago
Automated compositional Markov chain generation for a plain-old telephone system
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Holger Hermanns, Joost-Pieter Katoen
ICFP
2007
ACM
16 years 6 months ago
Tangible functional programming
We present a user-friendly approach to unifying program creation and execution, based on a notion of "tangible values" (TVs), which are visual and interactive manifestat...
Conal Elliott
ICFP
2006
ACM
16 years 6 months ago
Modular development of certified program verifiers with a proof assistant
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
Adam J. Chlipala
ICFP
2006
ACM
16 years 6 months ago
Good advice for type-directed programming aspect-oriented programming and extensible generic functions
Type-directed programming is an important idiom for software design. In type-directed programming the behavior of programs is guided by the type structure of data. It makes it pos...
Geoffrey Washburn, Stephanie Weirich
ICFP
2001
ACM
16 years 6 months ago
Developing a Stage Lighting System from Scratch
Lula is a system for computer-assisted stage lighting design and control. Whereas other systems for the same purpose are usually the results of long chains of incremental improvem...
Michael Sperber