Logic and Computability Laboratory
Logic and Computability Laboratory
Research Areas:
Research Areas:
Computability,
Models of Computation,
Complexity, Logic,
Formal Verification, and
Combinatorics
The LCLab focuses on doing computer science on the areas of discrete mathematics, and theories of formal languages, automata, computability and complexity. The current concerns of the group include Computability and Complexity of Nature- and Bio-Inspired Computing Models, Formal Verification of some Algorithms and Cryptographic Protocols, and Discrete Mathematics, Combinatorics and Logic.
The LCLab focuses on doing computer science on the areas of discrete mathematics, and theories of formal languages, automata, computability and complexity. The current concerns of the group include Computability and Complexity of Nature- and Bio-Inspired Computing Models, Formal Verification of some Algorithms and Cryptographic Protocols, and Discrete Mathematics, Combinatorics and Logic.
Research & Projects
Research & Projects
List of Topics of Current Interests of LCLab members, (but not limited to):
List of Topics of Current Interests of LCLab members, (but not limited to):
[If interested, please contact any members of the group for details of the projects/topics listed below]
[If interested, please contact any members of the group for details of the projects/topics listed below]
- Developing a tool that may help colleagues doing formal verification of algorithms of (critical) application systems.
- Formal Verification of some algorithms and possibly cryptographic protocols and some unconventional computing models such as P systems and quantum algorithms.
- Recursion Theory: Application of inductive operator to determine the descriptive complexity of some sets.
- Complexity and Decoherence: In 2015, we suggested a possibly another way of investigating decoherence of quantum algorithms. I would be interesting to investigate the suggested decoherence measure some quantum optimization algorithms.
- Optimization of quantum computer simulator.
- Topics on Communication complexity, automata and formal languages.
Current Graduate Students Projects
Current Graduate Students Projects
PhD Projects:
PhD Projects:
Communication Complexity in Distributed P Systems with Active Membrane
Kelvin Buno
On TCS, Discrete Maths and Models of Computing
Nestine Hope Hernandez
Analyses of Fitness Landscape of Some Biological Data
Cherry Estabillo (with Dr. Jan C. Yap)
Master's Project
Master's Project
Designing Algorithms and Data Structures for Parallelize Quantum Decision Diagrams for Simulating Quantum Circuit
Jul Jon General [informally with ASTI c/o Jeffrey Aborot]
Formal Verification of ML Models
Jesserey Joseph
Undergrads Project
Undergrads Project
(AY 2024-2025)
(AY 2024-2025)
Research teams [TBA}
Research teams [TBA}
(AY 2023-2024)
(AY 2023-2024)
Formal Verification of Round Robin Algorithm Implementation Using Coq. Christian Choa, Brylle Logrono, Raymart Villos
Formal Verification of Round Robin Algorithm Implementation Using Coq. Christian Choa, Brylle Logrono, Raymart Villos
Formal Verification of Shortest Job First Algorithm and Properties in Coq. Jian Luteria, Andrei Tiangco
Formal Verification of Shortest Job First Algorithm and Properties in Coq. Jian Luteria, Andrei Tiangco
Formal Verification of FIFO Scheduling Algorithm using Coq Proof Assistant. Earl Wilbur A. Nogra, Aj Karl A. Valenzuela
Formal Verification of FIFO Scheduling Algorithm using Coq Proof Assistant. Earl Wilbur A. Nogra, Aj Karl A. Valenzuela