the functional translation from modal logic into first-order predicate logic is revised. Quantifier elimination of second-order predicates is used to translate almost arbitrary modal systems, i.e. not only modal formu...
详细信息
the proceedings contain 55 papers. the special focus in this conference is on programming Issues and Software Engineering. the topics include: A grand challenge for computing research;linear types for cashflow reengin...
ISBN:
(纸本)3540208135
the proceedings contain 55 papers. the special focus in this conference is on programming Issues and Software Engineering. the topics include: A grand challenge for computing research;linear types for cashflow reengineering;storing properties in grouped tagged tuples;a polymorphic radix-n framework for fast fourier transforms;intersecting classes and prototypes;making software more flexible;program construction in the context of evolutionary computation;a layered architecture sustaining model-driven and event-driven software development;the outside-in method of teaching introductory programming;numeric types in formal synthesis;on the possibility of provably secure obfuscating programs;verification-oriented language C-light and its structural operational semantics;application to synthesis of contracts;on the visualization and aesthetics of large graphs;data mappings in the model-view-controller pattern;the translation power of the futamura projections;a compiler generator for constraint logic programs;the supercompiler SCP4;partial evaluation for common intermediate language;verification of distributed dataspace architectures;using SPIN and STeP to verify business processes specifications;integrating tools for automatic program verification;open maps and trace semantics for timed partial order models;confidentiality for multithreaded programs via bisimulation;dynamic modification of system structures using LLPNs;principles for entity authentication;causality and replication in concurrent processes;event-driven traversal of logic circuits for re-evaluation of boolean functions in reactive systems;teams of pushdown automata;algebraic state machines: concepts and applications to security;combining aspects of reactive systems;OCL extended with temporal logic and the definition of transitive closure with OCL.
We study monitoring of visibly context-free properties. these properties reflect the common concept of nesting which arises naturally in software systems. they can be expressed e. g. in the temporal logic CaRet which ...
详细信息
ISBN:
(纸本)9783642407871;9783642407864
We study monitoring of visibly context-free properties. these properties reflect the common concept of nesting which arises naturally in software systems. they can be expressed e. g. in the temporal logic CaRet which extends LTL by means of matching calls and returns. the future fragment of CaRet enables us to give a direct unfolding-based automaton construction, similar to LTL. We provide a four-valued, impartial semantics on finite words which is particularly suitable for monitoring. this allows us to synthesize monitors in terms of deterministic push-down Mealy machines. To go beyond impartiality, we develop a construction for anticipatory monitors from visibly push-down.-automata by utilizing a decision procedure for emptiness.
作者:
Ahn, Ki YungDenney, EwenPortland State Univ
Portland OR 97207 USA NASA
Ames Res Ctr Mission Crit Technol Inc Moffett Field CA 94035 USA NASA
Ames Res Ctr Stinger Ghaffarian Technol Inc Moffett Field CA 94035 USA
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms correctly (that is, formalizing propertie...
详细信息
ISBN:
(纸本)9783642139765
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms correctly (that is, formalizing properties of an intended mathematical interpretation) is non-trivial in practice, and avoiding or even detecting unsoundness can sometimes be difficult to achieve. Moreover, speculating soundness of axioms based on the output of the provers themselves is not easy since they do not typically give counterexamples. We adopt the idea of model-based testing to aid axiom authors in discovering errors in axiomatizations. To test the validity of axioms, users define a computational model of the axiomatized logic by giving interpretations to the function symbols and constants in a simple declarative programming language. We have developed an axiom testing framework that helps automate model definition and test generation using off-the-shelf tools for meta-programming, property-based random testing, and constraint solving. We have experimented with our tool to test the axioms used in AUTOCERT, a program verification system that has been applied to verify aerospace flight code using a first-order axiomatization of navigational concepts, and were able to find counterexamples for a number of axioms.
In the same way the more conventional fields of computer science need some theory, including the mathematical foundations of the calculus and the establishment of formal models, neural computation also needs its own. ...
详细信息
ISBN:
(纸本)3540630473
In the same way the more conventional fields of computer science need some theory, including the mathematical foundations of the calculus and the establishment of formal models, neural computation also needs its own. the basic requirements of this model are modularity, "small grain", high connectivity, parametric local computation and some capacity of self-programming by means of the adjustment of these parameters. We present here a proposal in this line that allows the integration in a single frame of all current models (analogic, logic and inferential) and makes clear the natural way to bridge the symbolic and connectionistic perspectives of AI extending the model of local computation to hierarchic graphs, building networks by joining graphs and studying the set of operators we need for modifying local computation parameters values.
During elicitation and verification of specification for real time control systems the sequential-temporal aspects need to be treated separately. these aspects also require animation for verification and incremental r...
详细信息
During elicitation and verification of specification for real time control systems the sequential-temporal aspects need to be treated separately. these aspects also require animation for verification and incremental refinement of the specification. An automated tool kit can be used to mechanize animation of specification. An augmented Petri net modeling tool is adopted to capture the logical, sequential and timing dependencies of a real time control system. A description is also given of a logicprogramming based animator for automated animation of the Petri net description. the augmentations involve a predicate net approach and temporal extensions.
Although programming by Demonstration (PBD) has the potential to improve the productivity of unsophisticated users, previous PBD systems have used brittle, heuristic, domain-specific approaches to execution-trace gene...
详细信息
the proceedings contain 68 papers. the special focus in this conference is on Fuzzy logic and control system, Genetic algorithm and heuristic approaches, Artificial intelligence and machine learning, Similarity-based ...
ISBN:
(纸本)9783662467411
the proceedings contain 68 papers. the special focus in this conference is on Fuzzy logic and control system, Genetic algorithm and heuristic approaches, Artificial intelligence and machine learning, Similarity-based models, Classification and clustering techniques, Intelligent data processing, Feature extraction and Image recognition. the topics include: A study of laundry tidiness: laundry state determination using video and 3D sensors;direction control system on a carrier robot using fuzzy logic controller;multidimensional fuzzy association rules for developing decision support system at petra christian university;genetic algorithm for scheduling courses;optimization of auto equip function in role-playing game based on standard deviation of character’s stats using genetic algorithm;the design of net energy balance optimization model for crude palm oil production;ACO-LS algorithm for solving no-wait flow shop scheduling problem;implementation discrete cosine transform and radial basis function neural network in facial image recognition;implementation of artificial intelligence with 3 different characters of AI player on “Monopoly Deal” computer game;optimizing instruction for learning computer programming - a novel approach;the comparation of distance-based similarity measure to detection of plagiarism in indonesian text;document searching engine using term similarity vector space model on english and indonesian document;knowledge representation for image feature extraction;the data analysis of stock market using a frequency integrated spherical hidden markov self organizing map and a search engine development utilizing unsupervised learning approach.
the proceedings contain 37 papers. the special focus in this conference is on Concurrency theory. the topics include: the lambda-calculus with multiplicities;a multiset semantics for the pi-calculus with replication;m...
ISBN:
(纸本)9783540572084
the proceedings contain 37 papers. the special focus in this conference is on Concurrency theory. the topics include: the lambda-calculus with multiplicities;a multiset semantics for the pi-calculus with replication;model checking mobile processes;a practical technique for process abstraction;modular completeness for communication closed layers;the linear time — branching time spectrum II;a classification of models for concurrency;on the ill-timed but well-caused;on the reduction of chocs bisimulation to p-calculus bisimulation;a theory of bisimulation for the p-calculus;bisimulation equivalence is decidable for basic parallel processes;a pi-calculus semantics for an object-based design notation;programming with broadcasts;interpreting broadcast communication in SCCS;proof systems for message-passing process algebras;refinement and decomposition of value-passing action systems;partial-order methods for temporal verification;model construction for implicit specifications in modal logic;branching time temporal logic and amorphous tree automata;a generalized event structure for the muller unfolding of a safe net;domains of higher-dimensional automata;non interleaving process algebra;quiescence, fairness, testing, and the notion of implementation;two fully abstract models for UNITY;minimal memory schedules for dataflow networks;networks of real-time processes;loop parallelization in the polytope model;an algebra of communicating shared resources with dense time and priorities;an elimination theorem for regular behaviours with integration;a linear local model checking algorithm for CTL;local event structures and petri nets;a congruence theorem for structured operational semantics with predicates and from CML to process algebras.
Lunar landing problem is formulated as an optimal control problem and has been solved by Legendre Pseudospectral method. the landing problem is split into various stages to take into account various mission constraint...
详细信息
Lunar landing problem is formulated as an optimal control problem and has been solved by Legendre Pseudospectral method. the landing problem is split into various stages to take into account various mission constraints. Based on these constraints, the problem is split into three stages Hough Braking, Attitude Hold and Retargeting Legendre Pseudospectral method is used for solving this multiphase lunar landing problem. the idea of this method is to discretize the trajectory optimization as a nonlinear programming problem. Legendre Pseudospectral method was applied to approximate the state and the state differential equations as algebraic constraints. Optimal solutions of the above problem are those control variables which dynamically satisfy all mission constraints. the cost function considered is minimum fuel satisfying all mission constraints envisaged. the method guarantees a null (Mann fuel solution which satisfies terminal mission constraints in each stage as part of the formulation. the mission constraints considered in studying this problem are desired altitude, attitude and velocity while reaching the desired landing site from a specified perilune height. At touchdown, the lander orientation should be vertical favoring landing leg of the Lander to touch the Moons surface as desired. the commanded acceleration should be within the limit of the main engine thruster capability (saturation limit) which enforces maximum and minimum thrust constraints. (C) 2016, IFAC (international Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
暂无评论