Applying finite-state verification techniques to software systems looks attractive because they are capable of detecting very subtle defects in the logic design of these systems. Nevertheless, the integration of exist...
详细信息
Applying finite-state verification techniques to software systems looks attractive because they are capable of detecting very subtle defects in the logic design of these systems. Nevertheless, the integration of existing formal verification tools within programming environments is not yet easy, mainly because of the semantic gap between widely used programming languages and the languages used to describe system requirements. In this paper, we propose a formal requirement specification notation based on linear temporal logic, with regard to object oriented program elements, such as classes and interfaces. the specification is inherently object oriented and is meant for the verification of concurrent and distributed software systems. (C) 2003 Elsevier Inc. All rights reserved.
this volume contains the papers presented at the 21st international Conf- ence on Algorithmic Learning theory (ALT 2010), which was held in Canberra, Australia, October 6–8, 2010. the conference was co-located with t...
详细信息
ISBN:
(数字)9783642161087
ISBN:
(纸本)9783642161070
this volume contains the papers presented at the 21st international Conf- ence on Algorithmic Learning theory (ALT 2010), which was held in Canberra, Australia, October 6–8, 2010. the conference was co-located withthe 13th - ternational conference on Discovery Science (DS 2010) and withthe Machine Learning Summer School, which was held just before ALT 2010. the tech- cal program of ALT 2010, contained 26 papers selected from 44 submissions and ?ve invited talks. the invited talks were presented in joint sessions of bothconferences. ALT 2010 was dedicated to the theoretical foundations of machine learning and took place on the campus of the Australian National University, Canberra, Australia. ALT provides a forum for high-quality talks with a strong theore- cal background and scienti?c interchange in areas such as inductive inference, universal prediction, teaching models, grammatical inference, formal languages, inductivelogicprogramming, query learning, complexity of learning, on-line learning and relative loss bounds, semi-supervised and unsupervised learning, clustering,activelearning,statisticallearning,supportvectormachines,Vapnik- Chervonenkisdimension,probablyapproximatelycorrectlearning,Bayesianand causal networks, boosting and bagging, information-based methods, minimum descriptionlength,Kolmogorovcomplexity,kernels,graphlearning,decisiontree methods, Markov decision processes, reinforcement learning, and real-world - plications of algorithmic learning theory. DS 2010 was the 13thinternationalconference on Discovery Science and focused on the development and analysis of methods for intelligent data an- ysis, knowledge discovery and machine learning, as well as their application to scienti?c knowledge discovery. As is the tradition, it wasco-located and held in parallel with Algorithmic Learning theory.
Howe's HOL/Nuprl connection is an interesting example of a translation between two fundamentally different logics, namely a typed higher-order logic and a polymorphic extensional type theory. In earlier work we ha...
详细信息
ISBN:
(纸本)3540482814
Howe's HOL/Nuprl connection is an interesting example of a translation between two fundamentally different logics, namely a typed higher-order logic and a polymorphic extensional type theory. In earlier work we have established a proof-theoretic correctness result of the translation in a way that complements Howe's semantics-based justification and furthermore goes beyond the original HOL/Nuprl connection by providing the foundation for a proof translator. Using the Twelf logical framework, the present paper goes one step further. It presents the first rigorous formalization of this treatment in a logical framework, and hence provides a safe alternative to the translation of proofs.
From the recent advent of scripting tools integrated into commercial CAAD software and everyday design practice, the use of programming applied to an architectural design process becomes a necessary field of study. th...
详细信息
the proceedings contain 54 papers. the topics discussed include: document verification using n-grams and histograms of words;multi path transmission control protocols as a security solution;towards automated evaluatio...
ISBN:
(纸本)9781467398688
the proceedings contain 54 papers. the topics discussed include: document verification using n-grams and histograms of words;multi path transmission control protocols as a security solution;towards automated evaluation of domain usability;selection of minimal set of locations in the public service system design;linearization algorithms CLOS and LOOPS of the classes in programming languages: the formal definitions;an approach to concurrent/parallel programming in java;down to Hades and back - experiences gained in comprehending a distributed legacy system;component composition using linear logic and Petri nets;analysis of sequential algorithms as tools for modeling the chain-like-body evolution;approaches to human-computer interaction based on observation of a software developer;and Monte Carlo simulation of the young measures - comparison of random-number generators.
the proceedings contain 11 papers. the special focus in this conference is on Rewriting logic and Its Applications. the topics include: Automated Construction of Security Integrity Wrappers for Industry 4.0 Applicatio...
ISBN:
(纸本)9783030635947
the proceedings contain 11 papers. the special focus in this conference is on Rewriting logic and Its Applications. the topics include: Automated Construction of Security Integrity Wrappers for Industry 4.0 Applications;connecting Constrained Constructor Patterns and Matching logic;Analysis of the Runtime Resource Provisioning of BPMN Processes Using Maude;a Rule-Based System for Computation and Deduction in Mathematica;variants in the Infinitary Unification Wonderland;variant Satisfiability of Parameterized Strings;inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification;a Simplified Application of Howard’s Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems;strategies, Model Checking and Branching-Time Properties in Maude.
In this paper, we describe the development of a series of automatic theorem provers for a variety of logics. Provers are developed from a functional approach. the first prover is for Classical Propositional Calculus (...
详细信息
the proceedings contain 32 papers. the special focus in this conference is on Learning Boolean Functions, Margin-Based Learning, Learning with Queries and inductive Inference. the topics include: On the Eigen spectrum...
ISBN:
(纸本)3540001700
the proceedings contain 32 papers. the special focus in this conference is on Learning Boolean Functions, Margin-Based Learning, Learning with Queries and inductive Inference. the topics include: On the Eigen spectrum of the gram matrix and its relationship to the operator Eigen spectrum;interim report on a musical discovery project;learning structure from sequences, with applications in a digital library;on learning monotone Boolean functions under the uniform distribution;maximizing agreements and coagnostic learning;optimally-smooth adaptive boosting and application to agnostic learning;large margin classification for moving targets;on the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes uniform distribution;a general dimension for approximately learning Boolean functions;the complexity of learning concept classes with polynomial general dimension;on the absence of predictive complexity for some games;consistency queries in information extraction;ordered term tree languages which are polynomial time inductively inferable from positive data;reflective inductive inference of recursive functions;on the learnability of vector spaces;learning, logic, and topology in a common framework;a pathology of bottom-up hill-climbing in inductive rule learning;minimised residue hypotheses in relevant logic;compactness and learning of classes of unions of erasing regular pattern languages;a negative result on inductive inference of extended pattern languages;asymptotic optimality of transductive confidence machine and an efficient PAC algorithm for reconstructing a mixture of lines.
We propose RTECinc, an incremental version of RTEC, a composite event recognition engine with formal, declarative semantics, that has been shown to scale to several real-world data streams. RTEC deals with delayed arr...
详细信息
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.
暂无评论