426 Hits in 2.3 sec

Equivalences among logics of programs

Albert R. Meyer, Jerzy Tiuryn
1984 Journal of computer and system sciences (Print)  
When programs are modelled as effective flowcharts, the logics of deterministic and nondeterministic programs are equivalent.  ...  Several different first-order formal logics of programs-Algorithmic Logic, Dynamic Logic, and Logic of Effective Definitions-are compared and shown to be equivalent to a fragment of constructive Lolw .  ...  ACKNOWLEDGMENTS We are grateful to Piotr Berman and Rohit Parikh for their detailed comments.  ... 
doi:10.1016/0022-0000(84)90027-8 fatcat:ukkto76dovcihnk5t3nhdb7axe

Translating flowcharts to non-deterministic languages

Surinder Kumar Jain, Chenyi Zhang, Bernhard Scholz
2012 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation - PEPM '12  
In this work, we translate programs in a deterministic flowchart language to a non-deterministic algebraic modelling language.  ...  Modeling languages are used to verify software and can be classified into deterministic modeling languages and non-deterministic modeling languages.  ...  Acknowledgments This research was supported under Australian Research Council's Discovery Projects funding scheme (DP1096445) and Australian Research Council's Linkage Projects funding scheme (LP0989643  ... 
doi:10.1145/2103746.2103775 dblp:conf/pepm/JainZS12 fatcat:qrywu6qwl5elnhs6owl2e3ihwm

Page 2163 of Mathematical Reviews Vol. , Issue 82e [page]

1982 Mathematical Reviews  
So, the author considers deterministic programs as a special case of nondeterministic programs.  ...  First, he gives a semantics which allows him to study correctness of nondeterministic flowcharts in part II.  ... 

On flowchart theories: Part II. The nondeterministic case

Gh. Ştefǎnescu
1987 Theoretical Computer Science  
We give a calculus for nondeterministic flowchart schemes similar to the calculus of polynomials.  ...  It uses a formal representation of flowchart schemes and a natural equivalence on these formal representations.  ...  This means that all valid deterministic laws and the corresponding dual laws are to be considered as valid nondeterministic laws. Exa e.  ... 
doi:10.1016/0304-3975(87)90114-9 fatcat:j3yth7hm4behjfkrcfuv37rcdy

Cumulative subject index volumes 56–59

1983 Information and Control  
repetition of subwords in, 59, 13 Dynamic logic deterministic context-free, regular dynamic logic not interpretable in, 59, 94 and deterministic dynamic logic, 57, 48 regular, not interpretable  ...  flow-chart programs, 58, 59 Recursive flowchart schemes algebraic semantics of, 59, 108 Recursive programs and Herbrand interpretation, 56, 212 termination assertions for: completeness and axiomatic  ... 
doi:10.1016/s0019-9958(83)80037-0 fatcat:dtwnjwpfbndyfc26jagdqcnmwa

On the Descriptional Complexity of Production Systems

Peter Trum
1985 International Joint Conference on Artificial Intelligence  
In this framework these methods are compared from the viewpoint of descriptional complexity giving us some insight by which means problems can be described in an easy and succinct way.  ...  controlled production systems• Def. t An interpretation of a PSS Q « A, f) is a pair I = (D, h) where D is a nonempty set, the database of Q, and h is a mapping assigning to each pEP a predicate h(p)  ...  On the other hand it can be shown (Trum, The definition of execution under an interpretation I = (D, h) must be modified in the obvious way so that the meanings of the new predicates and actions are  ... 
dblp:conf/ijcai/Trum85 fatcat:khdn73thlfb2nigxduieobsm5q

Page 5312 of Mathematical Reviews Vol. , Issue 82m [page]

1982 Mathematical Reviews  
The cases of total and partial program correctness are treated in more detail, both for deterministic and nondeterministic programs.  ...  Every nondeterministic recursive program can be obtained from such schemes by interpreting the constant function symbols.  ... 

"During" cannot be expressed by "after"

Paweł Urzyczyn
1986 Journal of computer and system sciences (Print)  
From this we deduce that array assignments add to the power of logics based on nondeterministic effective tree-schemes and that rich tests add to the power of logics based on flowcharts.  ...  The proof of the main theorem is based on a result of Furst, Saxe, and Sipser (in "Proc. 22nd Found. of Comput. Sci.," 1981).  ...  Kfoury and two anonymous referees for their critical comments.  ... 
doi:10.1016/0022-0000(86)90005-x fatcat:ckuvyxjodbar7au5ail4obh37a

Book Review: Computers and intractability: A guide to the theory of $NP$-completeness

Ronald V. Book
1980 Bulletin of the American Mathematical Society  
The collection of all sets L(ir) such that m is a deterministic (resp., nondeterministic) program that operates in polynomial time is called the class of languages accepted deterministically (resp., nondeterministically  ...  (This interpretation of the notion of tractability is due to Cobham [1] and to Edmunds [2] .)  ...  The Thus the multiplication in pl( V) consists of both commutators and anticommutators.  ... 
doi:10.1090/s0273-0979-1980-14848-x fatcat:54te3npg6zhg7ona4mn6iyxhiy

Formal language theory and theoretical computer science [chapter]

Ronald V. Book
1975 Lecture Notes in Computer Science  
Abstraction for the sake of abstraction and beauty is one of the goals of modern pure mathematics [ i].  ...  In Part I I I discuss several problem areas where formal language theory may find interesting and fruitful application.  ...  search problems, and nondeterministic algorithms provide an efficient specification for algorithms which deterministically simulate nondeterministic processes.  ... 
doi:10.1007/3-540-07407-4_1 fatcat:64fovopjqzgftlykgg3b3sixhy

Page 3407 of Mathematical Reviews Vol. , Issue 83h [page]

1983 Mathematical Reviews  
We show that nondeterministic flowchart schemata of bounded nondeterminacy are modeled by this special case; the connection between finite failure and greatest fixpoint is then used to give a semantic  ...  characterization of termination, blocking, and non- termination of such flowchart schemata.”  ... 

Page 1281 of Mathematical Reviews Vol. 58, Issue 2 [page]

1979 Mathematical Reviews  
If J is an interpretation, then qj, p7,--~- is an enumeration of partial re- cursive functions obtained from a lexicographic enumeration of flowcharts and &/, ®/,- - - are the corresponding step-counting  ...  Mach., New York, 1979] that languages accepted in polynomial time by 2-way multi-head nondeterministic pushdown automata can be recognized on a deterministic Turing machine in (log n)* space.  ... 

A modification to the group delay and simulated annealing technique for characterization of peripheral nerve fiber size distributions for non-deterministic sampled data

R.B. Szlavik
2009 2009 Annual International Conference of the IEEE Engineering in Medicine and Biology Society  
In previous work, the efficacy of the group delay and simulated annealing approach was demonstrated in the context of a simulation study where deterministic functions were used to represent the single  ...  In this study we present a modification to the approach discussed previously that is applicable to nondeterministic functions of sampled data.  ...  Figure 1 . 1 Flowchart of the simulated annealing algorithm that computes an improved estimate of the nerve fiber diameter population set from the group delay estimated population set for non-deterministic  ... 
doi:10.1109/iembs.2009.5334609 pmid:19965031 fatcat:porbelkvtzfs7jv6vvprjizoqq

Concurrent Kleene algebra with tests and branching automata

Peter Jipsen, M. Andrew Moshier
2016 Journal of Logical and Algebraic Methods in Programming  
We also define deterministic branching automata and investigate their relation to (nondeterministic) branching automata.  ...  To express basic concurrent algorithms, we define concurrent deterministic flowchart schemas and relate them to branching automata and to concurrent Kleene algebras with tests.  ...  Deterministic and nondeterministic branching automata We now modify the automata of Section 2 to include concurrency.  ... 
doi:10.1016/j.jlamp.2015.12.005 fatcat:nhu7vxfcijcwbhvixcyulxnfrq

Functional behavior of nondeterministic and concurrent programs

Michael G. Main, David B. Benson
1984 Information and Control  
This notion of functional behavior can be extended to nondeterministic and concurrent programs using techniques from linear algebra.  ...  It is shown that in this model, free interpretations (essentially Herbrand universes) do not generally exist.  ...  Main has been partially supported by a grant from the University of Colorado Council on Research and Creative Work. We appreciate the referee's suggestions. I~CEIWD June 1983; ACCEPTED November 1984  ... 
doi:10.1016/s0019-9958(84)80032-7 fatcat:37xdc2itbrechgxgxwg7fqymnu
« Previous Showing results 1 — 15 out of 426 results