the proceedings contain 30 papers. the topics discussed include: incremental computation via partial evaluation;static and dynamic semantics processing;how to make destructive updates less destructive;on the power and...
ISBN:
(纸本)0897914198
the proceedings contain 30 papers. the topics discussed include: incremental computation via partial evaluation;static and dynamic semantics processing;how to make destructive updates less destructive;on the power and limitation of strictness analysis based on abstract interpretation;a relational approach to strictness analysis for higher-order polymorphic functions;automatic construction of sparse data flow evaluation graphs;dependence flow graphs: an algebraic approach to program dependencies;program optimization and parallelization using idioms;pointer-induced aliasing: a problem classification;subtyping recursive types;and a record calculus based on symmetric concatenation.
the proceedings contain 38 papers. the topics discussed include: a calculus of atomic actions;masked types for sound object initialization;flexible types: robust type inference for first-class polymorphism;modular cod...
ISBN:
(纸本)9781605583792
the proceedings contain 38 papers. the topics discussed include: a calculus of atomic actions;masked types for sound object initialization;flexible types: robust type inference for first-class polymorphism;modular code generation from synchronous block diagrams: modularity vs. code size;formal certification of code-based cryptographic proofs;a foundation for flow-based program matching: using temporal logic and model checking;SPEED: precise and efficient static estimation of program computational complexity;automatic modular abstractions for linear constraints;the third homomorphism theorem on trees: downward & upward lead to divide-and-conquer;feedback-directed barrier optimization in a strongly isolated STM;a combination framework for tracking partition sizes;the theory of deadlock avoidance via discrete control;and positive supercompilation for a higher order call-by-value language.
the proceedings contain 29 papers. the topics discussed include: environments as first class objects;semantic parallelization : a practical exercise in abstract interpretation;a logic for partially specified data stru...
ISBN:
(纸本)0897912152
the proceedings contain 29 papers. the topics discussed include: environments as first class objects;semantic parallelization : a practical exercise in abstract interpretation;a logic for partially specified data structures;axioms for concurrent objects;the concurrent logic programming language CP: definition and operational semantics;on strictness and its analysis;macro-by-example: deriving syntactic transformations from their specifications;automatic decomposition of scientific programs for parallel execution;binding performance at language design time;strictness analysis and denotational abstract interpretation;compiling strictness into streams;completeness and incompleteness of trace-based network proof systems;computable values can be classical;full abstraction of a real-time denotational semantics for an OCCAM-like language;concurrent transition system semantics of process networks;semantics for concurrency without powerdomains;and appraising fairness in languages for distributed programming.
the proceedings contain 23 papers. the topics discussed include: modeling of problem domains for driving program development systems;programming primitives for database languages;paths: an abstract alternative to poin...
ISBN:
(纸本)089791029X
the proceedings contain 23 papers. the topics discussed include: modeling of problem domains for driving program development systems;programming primitives for database languages;paths: an abstract alternative to pointers;program improvement by internal specialization;paging as a 'language processing' task;position paper on optimizing compilers;making the world safe for garbage collection;carrier arrays: an idiom-preserving extension to APL;axiomatic definitions of programminglanguages, II;formal program testing;the temporal logic of branching time;program logic without binding is decidable;on the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem;a program development tool;program verification based on denotational semantics;incremental evaluation for attribute grammars with application to syntax-directed editors;linear cost is sometimes quadratic;a precise inter-procedural data flow algorithm;verification of attribute grammar;dependence graphs and compiler optimizations;program optimization and exception handling;and inferring types in Smalltalk.
the proceedings contain 38 papers. the topics discussed include: extended naming conventions for communicating processes;programming aspects of VLSI;termination of probabilistic concurrent programs;optimal code for co...
ISBN:
(纸本)0897910656
the proceedings contain 38 papers. the topics discussed include: extended naming conventions for communicating processes;programming aspects of VLSI;termination of probabilistic concurrent programs;optimal code for control structures;unbounded speed variability in distributed communication systems;messages as active agents;automatic generation of machine specific code optimizers;a flexible approach to interprocedural data flow analysis and programs with recursive data structures;specification and synthesis of communicating processes using an extended temporal logic;guardians and actions: linguistic support for robust, distributed programs;a type declaration and inference system for Smalltalk;code generation and reorganization in the presence of pipeline constraints;unified dialogue management in the carousel system;eliminating redundant object code;lithe: a language combining a flexible syntax and classes;description -driven code generation using attribute grammars;experience with an attribute grammar-based compiler;optimal-time incremental semantic analysis for syntax-directed editors;and maple: a programming language and operating system.
the proceedings contain 28 papers. the topics discussed include: type inference with subtypes;a proper extension of ml with an effective type-assignment;global value numbers and redundant computations;strictness analy...
ISBN:
(纸本)0897912527
the proceedings contain 28 papers. the topics discussed include: type inference with subtypes;a proper extension of ml with an effective type-assignment;global value numbers and redundant computations;strictness analysis aids time analysis;structural subtyping and the notion of power type;on the adequacy of program dependence graphs for representing programs;polymorphic effect systems;stores and partial continuations as first-class objects in a language and its environment;integrating non-interfering versions of programs;detecting equality of variables in programs;correct flow analysis in continuation semantics;sacrificing simplicity for convenience: where do you draw the line?;towards fully abstract semantics for local variables: preliminary report;bisimulation can't be traced: preliminary report;the theory and practice of first-class prompts;inductive methods for reasoning about abstract data types;a compositional approach to superimposition;efficient dataflow analysis of logic programs;incremental data flow analysis via dominator and attribute updates;lifetime analysis of dynamically allocated objects;and optimal code generation for expression trees: an application of BURS theory.
the proceedings contain 30 papers. the special focus in this conference is on Verification, Model Checking, and Abstract Interpretation. the topics include: Interpolation and Quantifiers in Ortholattices;fun...
ISBN:
(纸本)9783031505232
the proceedings contain 30 papers. the special focus in this conference is on Verification, Model Checking, and Abstract Interpretation. the topics include: Interpolation and Quantifiers in Ortholattices;function Synthesis for Maximizing Model Counting;boosting Constrained Horn Solving by Unsat Core Learning;on the Verification of the Correctness of a Subgraph Construction Algorithm;efficient Local Search for Nonlinear Real Arithmetic;abstract Interpretation-Based Feature Importance for Support Vector Machines;generation of Violation Witnesses by Under-Approximating Abstract Interpretation;correctness Witness Validation by Abstract Interpretation;project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability;parameterized Verification of Disjunctive Timed Networks;Resilience and Home-Space for WSTS;Generic Model Checking for Modal Fixpoint Logics in COOL-MC;Model-Guided Synthesis for LTL over Finite Traces.
the proceedings contain 30 papers. the special focus in this conference is on Verification, Model Checking, and Abstract Interpretation. the topics include: Interpolation and Quantifiers in Ortholattices;fun...
ISBN:
(纸本)9783031505201
the proceedings contain 30 papers. the special focus in this conference is on Verification, Model Checking, and Abstract Interpretation. the topics include: Interpolation and Quantifiers in Ortholattices;function Synthesis for Maximizing Model Counting;boosting Constrained Horn Solving by Unsat Core Learning;on the Verification of the Correctness of a Subgraph Construction Algorithm;efficient Local Search for Nonlinear Real Arithmetic;abstract Interpretation-Based Feature Importance for Support Vector Machines;generation of Violation Witnesses by Under-Approximating Abstract Interpretation;correctness Witness Validation by Abstract Interpretation;project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability;parameterized Verification of Disjunctive Timed Networks;Resilience and Home-Space for WSTS;Generic Model Checking for Modal Fixpoint Logics in COOL-MC;Model-Guided Synthesis for LTL over Finite Traces.
this paper presents a program analysis to estimate uncaught exceptions in ML programs. this analysis relies on unification-based type inference in a non-standard type system, using rows to approximate boththe flow of...
详细信息
this paper presents a program analysis to estimate uncaught exceptions in ML programs. this analysis relies on unification-based type inference in a non-standard type system, using rows to approximate boththe flow of escaping exceptions (a la effect systems) and the flow of result values (a la control-flow analyses). the resulting analysis is efficient and precise; in particular, arguments carried by exceptions are accurately handled.
the benefits of module systems and lexically scoped syntactic abstraction (macro) facilities are well-established in the literature. this paper presents a system that seamlessly integrates modules and lexically scoped...
详细信息
the benefits of module systems and lexically scoped syntactic abstraction (macro) facilities are well-established in the literature. this paper presents a system that seamlessly integrates modules and lexically scoped macros. the system is fully static, permits mutually recursive modules, and supports separate compilation. We show that more dynamic module facilities are easily implemented at the source level in the extended language supported by the system.
暂无评论