Sciweavers

1140 search results - page 147 / 228
» Generating compilers for generated datapaths
Sort
View
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
15 years 1 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
159
Voted
TSE
2011
165views more  TSE 2011»
14 years 10 months ago
Bristlecone: Language Support for Robust Software Applications
— We present Bristlecone, a programming language for robust software systems. Bristlecone applications have two components: a high-level organization specification that describe...
Brian Demsky, Sivaji Sundaramurthy
SBMF
2010
Springer
205views Formal Methods» more  SBMF 2010»
14 years 10 months ago
A High-Level Language for Modeling Algorithms and Their Properties
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
Sabina Akhtar, Stephan Merz, Martin Quinson
215
Voted
SIGMOD
2009
ACM
142views Database» more  SIGMOD 2009»
16 years 3 months ago
A grammar-based entity representation framework for data cleaning
Fundamental to data cleaning is the need to account for multiple data representations. We propose a formal framework that can be used to reason about and manipulate data represent...
Arvind Arasu, Raghav Kaushik
113
Voted
LOPSTR
2009
Springer
15 years 9 months ago
Towards Just-In-Time Partial Evaluation of Prolog
Abstract. We introduce a just-in-time specializer for Prolog. Just-intime specialization attempts to unify of the concepts and benefits of partial evaluation (PE) and just-in-time...
Carl Friedrich Bolz, Michael Leuschel, Armin Rigo