4 Hits in 8.4 sec

Configuration Space Exploration for Digital Printing Systems [chapter]

Jasper Denkers, Marvin Brunner, Louis van Gool, Eelco Visser
2021 Lecture Notes in Computer Science  
explore the use of a modeling language for finishers to realize optimizing decision making over configuration parameters in a systematic way and to reduce development time by generating control software  ...  We describe the implementation of the CSX compiler and the CSX programming environment (IDE), which supports well-formedness checking, inhabitance checking, and interactive configuration space exploration  ...  Programming Languages and Systems - 24th European Sympo- sium on Programming, ESOP 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK  ... 
doi:10.1007/978-3-030-92124-8_24 fatcat:tl4ozvke2fgstepu72k63gq2ha

A Theory of Name Resolution [chapter]

Pierre Neron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth
2015 Lecture Notes in Computer Science  
Based on the resolution calculus we develop language-independent definitions of α-equivalence and rename refactoring. We illustrate the approach using a small example language with modules.  ...  We describe a language-independent theory for name binding and resolution, suitable for programming languages with complex scoping rules including both lexical scoping and modules.  ...  We thank the anonymous reviewers for their feedback on previous versions  ... 
doi:10.1007/978-3-662-46669-8_9 fatcat:4lxvofyc7rcodef5j7bnx7jkri

Order out of Chaos: Proving Linearizability Using Local Views [article]

Yotam M. Y. Feldman and Constantin Enea and Adam Morrison and Noam Rinetzky and Sharon Shoham
2018 arXiv   pre-print
To apply our framework, the user proves that the data structure satisfies two conditions: (1) acyclicity of the order on memory, even when it is considered across intermediate memory states, and (2) preservation  ...  Basing the correctness of traversals on such local view arguments greatly simplifies linearizability proofs.  ...  This publication is part of a project that has received funding from the Eu-  ... 
arXiv:1805.03992v3 fatcat:cqrr4crygncctnvzp6eueap4qa

On Probabilistic Termination of Functional Programs with Continuous Distributions [article]

Raven Beutner, Luke Ong
2021 pre-print
Unlike in a deterministic language, the number of recursion call sites has direct consequences on the termination probability.  ...  In the second part, we present a method of proving AST for non-affine programs, i.e., recursive programs that can, during the evaluation of the recursive body, make multiple recursive calls (of a first-order  ...  In Programming Languages and Systems -30th European Symposium on Programming, ESOP 2021, Held as Part of the European Joint Conferences on Theory and Practice of Soft- ware, ETAPS 2021, Luxembourg City  ... 
doi:10.1145/3453483.3454111 arXiv:2104.04990v1 fatcat:g7jwfkwptjcxvijk25q2xvooza