Sciweavers

172 search results - page 17 / 35
» Structure and Properties of Traces for Functional Programs
Sort
View
TSE
2010
148views more  TSE 2010»
13 years 5 months ago
Program Behavior Discovery and Verification: A Graph Grammar Approach
—Discovering program behaviors and functionalities can ease program comprehension and verification. Existing program analysis approaches have used text mining algorithms to infer...
Chunying Zhao, Jun Kong, Kang Zhang
CORR
2008
Springer
142views Education» more  CORR 2008»
13 years 7 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
ICTAC
2005
Springer
14 years 1 months ago
The Timer Cascade: Functional Modelling and Real Time Calculi
Case studies can significantly contribute towards improving the understanding of formalisms and thereby to their applicability in practice. One such case, namely a cascade of the ...
Raymond T. Boute, Andreas Schäfer
MP
2006
175views more  MP 2006»
13 years 7 months ago
Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse
In classical two-stage stochastic programming the expected value of the total costs is minimized. Recently, mean-risk models - studied in mathematical finance for several decades -...
Rüdiger Schultz, Stephan Tiedemann
CORR
2010
Springer
198views Education» more  CORR 2010»
13 years 4 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...