the proceedings contain 26 papers. the special focus in this conference is on Compilers and Separation logic. the topics include: Memory-efficient tail calls in the JVM with imperative functional objects;a secure comp...
ISBN:
(纸本)9783319265285
the proceedings contain 26 papers. the special focus in this conference is on Compilers and Separation logic. the topics include: Memory-efficient tail calls in the JVM with imperative functional objects;a secure compiler for ML modules;a complete and polynomial-time algorithm in SSA;separation logic with monadic inductive definitions and implicit existentials;tree-like grammars and separation logic;randomized resource-aware path-sensitive static analysis;an extension of zonotopes to quadratic arithmetics;abstraction of optional numerical values;fault-tolerant resource reasoning;a blame calculus with delimited control;aliasing control in an imperative pure calculus;a strong distillery;from call-by-value to interaction by typed closure conversion;a marriage of game semantics and operational techniques;automata-based abstraction for automated verification of higher-order tree-processing programs;decision algorithms for checking definability of order-2 finitary PCF;uncovering javascript performance code smells relevant to type mutations;analyzing distributed multi-platform java and android applications with shadowVM;quasi-linearizability is undecidable;objects in polynomial time;programming techniques for reversible comparison sorts;transactions on mergeable objects;a sound type system for layer subtyping and dynamically activated first-class layers;bottom-up context-sensitive pointer analysis for java and more sound static handling of java reflection.
Strong equivalence of logic programs is an important concept in the theory of answer set programming. Equilibrium logic was used to show that propositional formulas are strongly equivalent if and only if they are equi...
详细信息
Performance analysis and tuning are well established software engineering processes in the realm of imperative programming. this work is a step towards establishing the standards of performance analysis in the realm o...
详细信息
We present an algorithm, CDCL-AMS, for solving Modular Systems consisting of a set of modules where, for each module, we have a simple "black-box" solver. the algorithm is based on the Conflict- Directed Cla...
详细信息
Where do the predicates in a game ontology come from? We use RGBD vision to learn a) the spatial structure of a board, and b) the number of parameters in a move or transition. these are used to define state-transition...
详细信息
ISBN:
(纸本)9783319161815;9783319161808
Where do the predicates in a game ontology come from? We use RGBD vision to learn a) the spatial structure of a board, and b) the number of parameters in a move or transition. these are used to define state-transition predicates for a logical description of each game state. Given a set of videos for a game, we use an improved 3D multi-object tracking to obtain the positions of each piece in games such as 4-peg solitaire or Towers of Hanoi. the spatial positions occupied by pieces over the entire game is clustered, revealing the structure of the board. Each frame is represented as a Semantic Graph with edges encoding spatial relations between pieces. Changes in the graphs between game states reveal the structure of a "move". Knowledge from spatial structure and semantic graphs is mapped to FOL descriptions of the moves and used in an inductivelogic framework to infer the valid moves and other rules of the game. Discovered predicate structures and induced rules are demonstrated for several games with varying board layouts and move structures.
Forest logic Programs (FoLP) are a decidable fragment of Open Answer Set programming (OASP) which have the forest model property. OASP extends Answer Set programming (ASP) with open domains—a feature which makes it p...
详细信息
logic programs with graded modality (LPGMs) combine ideas underlying graded modal logic and answer set programming. logicprogramming under answer set semantics is extended with a new graded modality M[lb:ub] where lb...
详细信息
this work makes an overview on an hybrid formalism that combines the syntax of Linear-time Temporal logic (LTL) with a nonmonotonic selection of models based on Equilibrium logic. the resulting approach, called Tempor...
详细信息
We present a new approach to evaluate conditionals in human reasoning. this approach is based on the weak completion semantics which has been successfully applied to adequately model various other human reasoning task...
详细信息
My work on PhD thesis consists in nonmonotonic reasoning about spatial relations and how they change in time. Although there are several approaches concerning this topic, to the best of my knowledge, there is no gener...
详细信息
暂无评论